Sciweavers

1836 search results - page 2 / 368
» Mining Clustering Dimensions
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 5 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
DAGSTUHL
2007
13 years 6 months ago
Subspace outlier mining in large multimedia databases
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
Ira Assent, Ralph Krieger, Emmanuel Müller, T...
ICDE
2007
IEEE
211views Database» more  ICDE 2007»
13 years 11 months ago
Document Representation and Dimension Reduction for Text Clustering
Increasingly large text datasets and the high dimensionality associated with natural language create a great challenge in text mining. In this research, a systematic study is cond...
M. Mahdi Shafiei, Singer Wang, Roger Zhang, Evange...
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
13 years 10 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
JDCTA
2010
122views more  JDCTA 2010»
13 years 2 days ago
The Application Research of High-dimensional Mixed-attribute Data Clustering Algorithm
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
Lilin Fan, Chunhong Liu, Qian Liu