Sciweavers

33 search results - page 1 / 7
» A General Framework for Fast Co-clustering on Large Datasets...
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 6 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 4 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
13 years 10 months ago
A Scalable Collaborative Filtering Framework Based on Co-Clustering
Collaborative filtering-based recommender systems, which automatically predict preferred products of a user using known preferences of other users, have become extremely popular ...
Thomas George, Srujana Merugu
ICASSP
2011
IEEE
12 years 8 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
13 years 8 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt