1897 search results - page 323 / 380 » Mining Chains of Relations |
KDD
2003
ACM
15 years 10 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
116
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
: se the concept of visualizing general abstract data by intermediate projection into the hyperbolic space. Its favorable properties were reported earlier and led to the "hype...
KDD
2001
ACM
15 years 10 months ago
2001
ACM
During the last decade, the area of bioinformatics has produced an overwhelming amount of data, with the recently published draft of the human genome being the most prominent exam...