DMKD 1997 | Sciweavers

19

DMKD
1997
ACM

308views Data Mining» more DMKD 1997»

A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining

13 years 8 months ago

Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...

Zhexue Huang

claim paper

Read More »

12

click to vote

DMKD
1997
ACM

198views Data Mining» more DMKD 1997»

Clustering Based On Association Rule Hypergraphs

13 years 8 months ago

Download glaros.dtc.umn.edu

Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...

Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...

claim paper

Read More »

8

click to vote

DMKD
1997
ACM

101views Data Mining» more DMKD 1997»

On the Complexity of Mining Temporal Trends

13 years 8 months ago

Download timecenter.cs.aau.dk

Jef Wijsen, Robert Meersman

claim paper