Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jimmy Lee

dblp:164/0542 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-7724-7445ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5Artificial intelligence and machine learning · 4 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%
Theoretical computer science
1 paper
Computational complexity · 50% Distributed computing theory · 50%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
branch-and-bound search
0.412020
Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining · AAAI 2020
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint optimization
0.412020
Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining · AAAI 2020
Computational complexity
constraint satisfaction
0.412019
DoubleLex Revisited and Beyond · IJCAI 2019
Distributed computing theory
symmetry breaking
0.412019
DoubleLex Revisited and Beyond · IJCAI 2019
Data mining › pattern mining
frequent pattern mining
0.112020
Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining · AAAI 2020
Data mining
pattern mining
0.112020
Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining · AAAI 2020

Methods — techniques the papers use, named apart from their topics

frequent pattern mining · 0.9graph coloring · 0.4
YearPublicationVenuePosition
2023 Filter and Wrapper Stacking Ensemble (FWSE): a robust approach for reliable biomarker discovery in high-dimensional omics data
abstract
Selecting informative features, such as accurate biomarkers for disease diagnosis, prognosis and response to treatment, is an essential task in the field of bioinformatics. Medical data often contain thousands of features and identifying potential biomarkers is challenging due to small number of samples in the data, method dependence and non-reproducibility. This paper proposes a novel ensemble feature selection method, named Filter and Wrapper Stacking Ensemble (FWSE), to identify reproducible biomarkers from high-dimensional omics data. In FWSE, filter feature selection methods are run on numerous subsets of the data to eliminate irrelevant features, and then wrapper feature selection methods are applied to rank the top features. The method was validated on four high-dimensional medical datasets related to mental illnesses and cancer. The results indicate that the features selected by FWSE are stable and statistically more significant than the ones obtained by existing methods while also demonstrating biological relevance. Furthermore, FWSE is a generic method, applicable to various high-dimensional datasets in the fields of machine intelligence and bioinformatics.
Sugam Budhraja, Maryam Doborjeh, Balkaran Singh, Samuel Tan, Zohreh Gholami Doborjeh, Edmund M.-K. Lai, Alexander Merkin, Jimmy Lee, Wilson Wen Bin Goh, Nikola K. Kasabov
Briefings Bioinform.8
2023 Transfer Learning of Fuzzy Spatio-Temporal Rules in a Brain-Inspired Spiking Neural Network Architecture: A Case Study on Spatio-Temporal Brain Data
abstract
The article demonstrates for the first time that a brain-inspired spiking neural network (SNN) architecture can be used not only to learn spatio-temporal data, but also to extract fuzzy spatio-temporal rules from such data and to update these rules incrementally in a transfer learning mode. We propose a method, where a SNN model learns incrementally new time-space data related to new classes/tasks/categories, always utilizing some previously learned knowledge, and presents the evolved knowledge as fuzzy spatio-temporal rules. Similarly, to how the brain manifests transfer learning, these SNN models do not need to be restricted in number of layers and neurons in each layer as they adopt self-organizing learning principles. The continuously evolved fuzzy rules from spatio-temporal data are interpretable for a better understanding of the processes that generate the data. The proposed method is based on a brain-inspired SNN architecture NeuCube, which is structured according to a brain three-dimensional structural template. It is illustrated on tasks of incremental and transfer learning and knowledge transfer using spatio-temporal data measuring brain activity, when subjects are performing tasks in space and time. The method is a general one and opens the field to create new types of adaptable and explainable spatio-temporal learning systems across domain areas.
Nikola K. Kasabov, Yongyao Tan, Maryam Doborjeh, Enmei Tu, Jie Yang 0002, Wilson Wen Bin Goh, Jimmy Lee
IEEE Trans. Fuzzy Syst.7
2020 Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining
abstract
Making good decisions at the top of a search tree is important for finding good solutions early in constraint optimization. In this paper, we propose a method employing frequent pattern mining (FPM), a classic datamining technique, to find good subtrees for solving constraint optimization problems. We demonstrate that applying FPM in a small number of random high-quality feasible solutions enables us to identify subtrees containing optimal solutions in more than 55% of problem instances for four real world benchmark problems. The method works as a plugin that can be combined with any search strategy for branch-and-bound search. Exploring the identified subtrees first, the method brings substantial improvements for four efficient search strategies in both total runtime and runtime of finding optimal solutions.
Hongbo Li 0005, Jimmy Lee, He Mi, Minghao Yin
AAAI2
2019 Statistical Learning Ability as a Measure of Cognitive Function
Steffen Herff, Nur Amirah Abdul Rashid, Jimmy Lee, Tih Shih Lee, Kat Agres
CogSci3
2019 DoubleLex Revisited and Beyond
abstract
The paper proposes Maximum Residue (MR) as a notion to evaluate the strength of a symmetry breaking method. We give a proof to improve the best known DoubleLex MR upper bound from m!n! - (m!+n!) to min(m!,n!) for an m x n matrix model. Our result implies that DoubleLex works well on matrix models where min(m, n) is relatively small. We further study the MR bounds of SwapNext and SwapAny, which are extensions to DoubleLex breaking further a small number of composition symmetries. Such theoretical comparisons suggest general principles on selecting Lex-based symmetry breaking methods based on the dimensions of the matrix models. Our experiments confirm the theoretical predictions as well as efficiency of these methods.
Xuming Huang, Jimmy Lee
IJCAI2
2018 Prediction of Negative Symptoms of Schizophrenia from Emotion Related Low-Level Speech Signals
abstract
Negative symptoms of schizophrenia are often associated with the blunting of emotional affect which creates a serious impediment in the daily functioning of the patients. Affective prosody is almost always adversely impacted in such cases, and is known to exhibit itself through the low-level acoustic signals of prosody. To automate and simplify the process of assessment of severity of emotion related symptoms of schizophrenia, we utilized these low-level acoustic signals to predict the expert subjective ratings assigned by a trained psychologist during an interview with the patient. Specifically, we extract acoustic features related to emotion using the openSMILE toolkit from the audio recordings of the interviews. We analysed the interviews of 78 paid participants (52 patients and 26 healthy controls) in this study. The subjective ratings could be accurately predicted from the objective openSMILE acoustic signals with an accuracy of 61-85% using machine-learning algorithms with leave-one-out cross-validation technique. Furthermore, these objective measures can be reliably utilized to distinguish between the patient and healthy groups, as supervised learning methods can classify the two groups with 79-86% accuracy.
Debsubhra Chakraborty, Zixu Yang, Yasir Tahir, Tomasz Maszczyk, Justin Dauwels, Nadia Magnenat-Thalmann, Jianmin Zheng, Yogeswary Maniam, Nur Amirah, Bhing-Leet Tan, Jimmy Lee
ICASSP11
2017 Assessment and prediction of negative symptoms of schizophrenia from RGB+D movement signals
abstract
Negative symptoms of schizophrenia significantly affect the daily functioning of patients, especially movement and expressive gestures. The diagnosis of such symptoms is often difficult and require the expertise of a trained clinician. Apart from these subjective methods, there is little research on developing objective methods to quantify the symptoms. Therefore, we explore body movement signals as objective measures of negative symptoms. Specifically, we extract the signals from video recordings of patients being interviewed. We analysed the interviews of 69 paid participants (46 patients and 23 healthy controls) in this study. Correlation between movement signals (linear and angular speeds of upper limbs and head, acceleration and gesture angles) and subjective ratings (assigned during same interview) from the NSA-16 scale were calculated. As hypothesized, the movement signals correlated strongly with the movement impairment aspect of the NSA-16 questionnaire. Also, not quite surprisingly, strong correlations were obtained between the movement signals and speech items of NSA-16, indicating lack of associated gestures in patients during speech. These subjective ratings could also be reasonably predicted from the objective signals with an accuracy of 61-78% using machine-learning algorithms with leave-one-out cross-validation technique. Furthermore, these objective measures can be reliably utilized to distinguish between the patient and healthy groups, as supervised learning methods can classify the two groups with 74-87% accuracy.
Debsubhra Chakraborty, Yasir Tahir, Zixu Yang, Tomasz Maszczyk, Justin Dauwels, Daniel Thalmann, Nadia Magnenat-Thalmann, Bhing-Leet Tan, Jimmy Lee
MMSP9
2016 Non-verbal speech analysis of interviews with schizophrenic patients
abstract
Negative symptoms in schizophrenia are associated with significant burden and functional impairment, especially speech production. In clinical practice today, there are no robust treatments for negative symptoms and one obstacle surrounding its research is the lack of an objective measure. To this end, we explore non-verbal speech cues as objective measures. Specifically, we extract these cues while schizophrenic patients are interviewed by psychologists. We have analyzed interviews of 15 patients who were enrolled in an observational study on the effectiveness of Cognitive Remediation Therapy (CRT). The subject (undergoing CRT) and control group (not undergoing CRT) contains 8 and 7 individuals respectively. The patients were recorded during three sessions while being evaluated for negative symptoms over a 12-week follow-up period. In order to validate the non-verbal speech cues, we computed their correlation with the Negative Symptom Assessment (NSA-16). Our results suggest a strong correlation between certain measures of the two rating sets. Supervised prediction of the subjective ratings from the non-verbal speech features with leave-one-person-out cross-validation has reasonable accuracy of 53-80%. Furthermore, the non-verbal cues can be used to reliably distinguish between the subjects and controls, as supervised learning methods can classify the two groups with 80-93% accuracy.
Yasir Tahir, Debsubhra Chakraborty, Justin Dauwels, Nadia Magnenat-Thalmann, Daniel Thalmann, Jimmy Lee
ICASSP6