Sciweavers

1836 search results - page 3 / 368
» Mining Clustering Dimensions
Sort
View
SBBD
2000
168views Database» more  SBBD 2000»
13 years 7 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...
KDD
2005
ACM
135views Data Mining» more  KDD 2005»
14 years 6 months ago
A hybrid unsupervised approach for document clustering
We propose a hybrid, unsupervised document clustering approach that combines a hierarchical clustering algorithm with Expectation Maximization. We developed several heuristics to ...
Mihai Surdeanu, Jordi Turmo, Alicia Ageno
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 10 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 3 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
ICDE
2000
IEEE
112views Database» more  ICDE 2000»
14 years 7 months ago
DEMON: Mining and Monitoring Evolving Data
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...