Sciweavers

1768 search results - page 65 / 354
» Mining Very Large Databases
Sort
View
ICDM
2002
IEEE
159views Data Mining» more  ICDM 2002»
14 years 2 months ago
O-Cluster: Scalable Clustering of Large High Dimensional Data Sets
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
Boriana L. Milenova, Marcos M. Campos
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 3 months ago
MaPle: A Fast Algorithm for Maximal Pattern-based Clustering
Pattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-...
Jian Pei, Xiaoling Zhang, Moonjung Cho, Haixun Wan...
CIKM
2009
Springer
14 years 2 months ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
CINQ
2004
Springer
151views Database» more  CINQ 2004»
14 years 1 months ago
Query Languages Supporting Descriptive Rule Mining: A Comparative Study
Recently, inductive databases (IDBs) have been proposed to tackle the problem of knowledge discovery from huge databases. With an IDB, the user/analyst performs a set of very diffe...
Marco Botta, Jean-François Boulicaut, Cyril...
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 3 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal