Sciweavers

344 search results - page 44 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
ECML
2006
Springer
15 years 5 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
KDD
2004
ACM
108views Data Mining» more  KDD 2004»
16 years 1 months ago
Sleeved coclustering
A coCluster of a m?n matrix X is a submatrix determined by a subset of the rows and a subset of the columns. The problem of finding coClusters with specific properties is of inter...
Avraham A. Melkman, Eran Shaham
ISIM
2007
15 years 2 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
CSDA
2007
131views more  CSDA 2007»
15 years 1 months ago
Bivariate density estimation using BV regularisation
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...
Andreas Obereder, Otmar Scherzer, Arne Kovac
ICPP
2000
IEEE
15 years 5 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary