1301 search results - page 68 / 261 » Default Clustering from Sparse Data Sets |
SETN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
ICDM
2003
IEEE
14 years 2 months ago
2003
IEEE
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
SIGKDD
2010
13 years 4 months ago
2010
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
SSD
2005
Springer
14 years 2 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
ICDM
2007
IEEE
14 years 3 months ago
2007
IEEE
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...