5046 search results - page 345 / 1010 » Non-redundant data clustering |
136
click to vote
PODS
2005
ACM
16 years 7 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
203
click to vote
EWSN
2004
Springer
16 years 6 months ago
2004
Springer
Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wid...
189
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
224
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
171
click to vote
SAC
2006
ACM
16 years 23 days ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...