SQLEM: Fast Clustering in SQL using the EM Algorithm

Clustering is one of the most important tasks performed in Data Mining applications. This paper presents an e cient SQL implementation of the EM algorithm to perform clustering in very large databases. Our version can e ectively handle high dimensional data, a high number of clusters and more importantly, a very large number of data records. We present three strategies to implement EM in SQL: horizontal, vertical and a hybrid one. We expect this work to be useful for data mining programmers and users who want to cluster large data sets inside a relational DBMS.

• Type: Conference
• Year: 2000
• Where: SIGMOD
• Authors: Carlos Ordonez, Paul Cereghini
• Keywords: Data Mining, Data Mining Applications, Data Mining Programmers, Database, SIGMOD 2000