3070 search results - page 404 / 614 » Making pattern mining useful |
210
click to vote
KDD
2000
ACM
15 years 7 months ago
2000
ACM
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
160
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
162
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
142
click to vote
OSDI
2008
ACM
16 years 4 months ago
2008
ACM
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
100
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...