5046 search results - page 348 / 1010 » Non-redundant data clustering |
168
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
176
click to vote
NIPS
2001
15 years 8 months ago
2001
The Information bottleneck method is an unsupervised non-parametric data organization technique. Given a joint distribution
136
click to vote
AUSDM
2007
Springer
16 years 1 months ago
2007
Springer
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
162
Voted
IV
2000
IEEE
15 years 10 months ago
2000
IEEE
We are generating music from a particular view of a multi-dimensional geographic information system (GIS) data set to alert a viewer to the existence of hidden clusters of data po...
165
click to vote
ICDM
2006
IEEE
16 years 26 days ago
2006
IEEE
The nonnegative matrix factorization (NMF) has been shown recently to be useful for clustering. Various extensions of NMF have also been proposed. In this paper we present an over...