Sciweavers

1215 search results - page 171 / 243
» Numbers in Multi-relational Data Mining
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 15 hour 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
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
16 years 1 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
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
15 years 6 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov
CAMP
2005
IEEE
15 years 5 months ago
Virtual Astronomy, Information Technology, and the New Scientific Methodology
—All sciences, including astronomy, are now entering the era of information abundance. The exponentially increasing volume and complexity of modern data sets promises to transfor...
S. George Djorgovski
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 1 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal