5046 search results - page 274 / 1010 » Non-redundant data clustering |
180
click to vote
IS
2008
15 years 6 months ago
2008
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
136
click to vote
ESANN
2007
15 years 8 months ago
2007
This paper presents a new algorithm for clustering. It is an generalisation of the K-means algorithms . Each cluster will be represented by a chain of prototypes instead of being r...
175
click to vote
NIPS
2004
15 years 8 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
188
click to vote
PKDD
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
167
click to vote
ICSE
1999
IEEE-ACM
15 years 11 months ago
1999
IEEE-ACM
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...