5046 search results - page 298 / 1010 » Non-redundant data clustering |
184
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
214
click to vote
INEX
2005
Springer
16 years 7 days ago
2005
Springer
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...
181
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
166
click to vote
TKDE
2002
15 years 6 months ago
2002
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
213
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...