Sciweavers

22018 search results - page 4006 / 4404
» or 2004
Sort
View
182
Voted
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 7 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
230
Voted
KDD
2004
ACM
136views Data Mining» more  KDD 2004»
16 years 7 months ago
A cross-collection mixture model for comparative text mining
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
ChengXiang Zhai, Atulya Velivelli, Bei Yu
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
219
Voted
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
16 years 7 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
182
Voted
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
16 years 7 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
« Prev « First page 4006 / 4404 Last » Next »