Sciweavers

184 search results - page 14 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
ISMIR
2005
Springer
127views Music» more  ISMIR 2005»
14 years 1 months ago
Towards a Fast and Efficient Match Algorithm for Content-Based Music Retrieval on Acoustic Data
In this paper we present a fast and efficient match algorithm, which consists of two key techniques: Spectral Correlation Based Feature Merge(SCBFM) and Two-Step Retrieval(TSR). ...
Yi Yu, Chiemi Watanabe, Kazuki Joe
CVPR
2005
IEEE
14 years 9 months ago
A Weighted Nearest Mean Classifier for Sparse Subspaces
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...
Cor J. Veenman, David M. J. Tax
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
13 years 9 months ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
TKDE
2008
111views more  TKDE 2008»
13 years 7 months ago
Text Clustering with Feature Selection by Using Statistical Data
Abstract-- Feature selection is an important method for improving the efficiency and accuracy of text categorization algorithms by removing redundant and irrelevant terms from the ...
Yanjun Li, Congnan Luo, Soon M. Chung