Kai Ming Ting

Kai Ming Ting

Auto-generated profile, based on publicly available information

Kai Ming Ting

National Key Laboratory for Novel Software Technology and School of Artificial Intelligence, Nanjing University, Nanjing, China

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2008
Verified
Conference Paper
Closed access
FLFei Tony Liu
Fei Tony Liu
KTKai Ming Ting
Kai Ming Ting
ZZZhi-Hua Zhou
Zhi-Hua Zhou
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies. This paper proposes a fundamentally different model-based method that explicitly isolates anomalies instead of profiles normal points. To our best knowledge, the concept of isolation has not been explored in current literature. The use of isolation enables the proposed method, iForest, to exploit sub-sampling to an extent that is not feasible in existing methods, creating an algorithm which has a linear time complexity with a low constant and a low memory requirement. Our empirical evaluation shows that iForest performs favourably to ORCA, a near-linear time complexity distance-based method, LOF and random forests in terms of AUC and processing time, and especially in large data sets. iForest also works well in high dimensional problems which have a large number of irrelevant attributes, and in situations where training set does not contain any anomalies.

1 May 1999 in Journal of Artificial Intelligence Research
Verified
Journal Article
Closed access
PDF file
KTK. M. Ting
K. M. Ting
IWI. H. Witten
I. H. Witten
Stacked generalization is a general method of using a high-level model to combine lower-level models to achieve greater predictive accuracy. In this paper we address two crucial issues which have been considered to be a `black art' in classification tasks ever since the introduction of stacked generalization in 1992 by Wolpert: the type of generalizer that is suitable to derive the higher-level model, and the kind of attributes that should be used as its input. We find that best results are obtained when the higher-level model combines the confidence (and not just the predictions) of the lower-level ones. We demonstrate the effectiveness of stacked generalization for combining three different types of learning algorithms for classification tasks. We also compare the performance of stacked generalization with majority vote and published results of arcing and bagging.

7 August 2002 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KTKai Ming Ting
Kai Ming Ting
We introduce an instance-weighting method to induce cost-sensitive trees. It is a generalization of the standard tree induction process where only the initial instance weights determine the type of tree to be induced-minimum error trees or minimum high cost error trees. We demonstrate that it can be easily adapted to an existing tree learning algorithm. Previous research provides insufficient evidence to support the idea that the greedy divide-and-conquer algorithm can effectively induce a truly cost-sensitive tree directly from the training data. We provide this empirical evidence in this paper. The algorithm incorporating the instance-weighting method is found to be better than the original algorithm in in of total misclassification costs, the number of high cost errors, and tree size two-class data sets. The instance-weighting method is simpler and more effective in implementation than a previous method based on altered priors.

10 December 2010 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
ZFZhouyu Fu
Zhouyu Fu
GLGuojun Lu
Guojun Lu
KTKai Ming Ting
Kai Ming Ting
DZDengsheng Zhang
Dengsheng Zhang
Music information retrieval (MIR) is an emerging research area that receives growing attention from both the research community and music industry. It addresses the problem of querying and retrieving certain types of music from large music data set. Classification is a fundamental problem in MIR. Many tasks in MIR can be naturally cast in a classification setting, such as genre classification, mood classification, artist recognition, instrument recognition, etc. Music annotation, a new research area in MIR that has attracted much attention in recent years, is also a classification problem in the general sense. Due to the importance of music classification in MIR research, rapid development of new methods, and lack of review papers on recent progress of the field, we provide a comprehensive review on audio-based classification in this paper and systematically summarize the state-of-the-art techniques for music classification. Specifically, we have stressed the difference in the features and the types of classifiers used for different classification tasks. This survey emphasizes on recent development of the techniques and discusses several open issues for future research.

5 January 2018 in Computational Intelligence
Verified
Journal Article
Closed access
PDF file
TBTharindu R. Bandaragoda
Tharindu R. Bandaragoda
KTKai Ming Ting
Kai Ming Ting
DADavid Albrecht
David Albrecht
FLFei Tony Liu
Fei Tony Liu
YZYe Zhu
Ye Zhu
JWJonathan R. Wells
Jonathan R. Wells

14 April 2017
Verified
Book Chapter
Closed access
PDF file
KTKai Ming Ting
Kai Ming Ting