Sciweavers

474 search results - page 15 / 95
» Approximation Algorithms for Tensor Clustering
Sort
View
CIARP
2010
Springer
13 years 6 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 10 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
ICASSP
2011
IEEE
12 years 11 months ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 8 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
VIS
2004
IEEE
195views Visualization» more  VIS 2004»
14 years 9 months ago
Flow Field Clustering via Algebraic Multigrid
We present a novel multiscale approach for flow visualization. We define a local alignment tensor that encodes a measure for alignment to the direction of a given flow field. This...
Michael Griebel, Tobias Preußer, Martin Rump...