Sciweavers

1314 search results - page 141 / 263
» Approximate data mining in very large relational data
Sort
View
PAA
2002
15 years 1 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
15 years 8 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
16 years 2 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
KDD
2009
ACM
170views Data Mining» more  KDD 2009»
16 years 2 months ago
Genre-based decomposition of email class noise
Corruption of data by class-label noise is an important practical concern impacting many classification problems. Studies of data cleaning techniques often assume a uniform label ...
Aleksander Kolcz, Gordon V. Cormack
110
Voted
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
15 years 7 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010