5046 search results - page 64 / 1010 » Non-redundant data clustering |
233
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
166
click to vote
CIDM
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
138
click to vote
ASIAN
2005
Springer
15 years 11 months ago
2005
Springer
Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how ...
139
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
Pattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-...
CIKM
2008
Springer
15 years 8 months ago
2008
Springer