Sciweavers

1836 search results - page 126 / 368
» Mining Clustering Dimensions
Sort
View
112
Voted
CIMCA
2005
IEEE
15 years 7 months ago
Independent Nearest Features Memory-Based Classifier
The classification task is one of the most important problems in the area of data mining. In this paper we propose a new algorithm for addressing this problem. The main idea deriv...
Christos Pateritsas, Andreas Stafylopatis
ICMLA
2008
15 years 3 months ago
Graph-Based Multilevel Dimensionality Reduction with Applications to Eigenfaces and Latent Semantic Indexing
Dimension reduction techniques have been successfully applied to face recognition and text information retrieval. The process can be time-consuming when the data set is large. Thi...
Sophia Sakellaridi, Haw-ren Fang, Yousef Saad
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
16 years 3 months ago
Substructure Clustering on Sequential 3d Object Datasets
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
Zhenqiang Tan, Anthony K. H. Tung
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 2 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
15 years 8 months ago
Non-redundant Multi-view Clustering via Orthogonalization
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...
Ying Cui, Xiaoli Z. Fern, Jennifer G. Dy