Sciweavers

922 search results - page 160 / 185
» A data mining approach to database compression
Sort
View
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
14 years 11 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
INFOVIS
2003
IEEE
15 years 2 months ago
Exploring High-D Spaces with Multiform Matrices and Small Multiples
We introduce an approach to visual analysis of multivariate data that integrates several methods from information visualization, exploratory data analysis (EDA), and geovisualizat...
Alan M. MacEachren, Xiping Dai, Frank Hardisty, Di...
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 6 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
JCDL
2004
ACM
170views Education» more  JCDL 2004»
15 years 3 months ago
Looking for new, not known music only: music retrieval by melody style
With the growth of digital music, content-based music retrieval (CBMR) has attracted increasingly attention. For most CBMR systems, the task is to return music objects similar to ...
Fang-Fei Kuo, Man-Kwan Shan
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...