Sciweavers

11345 search results - page 1870 / 2269
» Foundations of Computer Science
Sort
View
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 1 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
SDM
2009
SIAM
143views Data Mining» more  SDM 2009»
16 years 1 months ago
Finding Representative Association Rules from Large Rule Collections.
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
Warren L. Davis IV, Peter Schwarz, Evimaria Terzi
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 1 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
SDM
2009
SIAM
215views Data Mining» more  SDM 2009»
16 years 1 months ago
Hybrid Clustering of Text Mining and Bibliometrics Applied to Journal Sets.
To obtain correlated and complementary information contained in text mining and bibliometrics, hybrid clustering to incorporate textual content and citation information has become...
Bart De Moor, Frizo A. L. Janssens, Shi Yu, Wolfga...
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 1 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
« Prev « First page 1870 / 2269 Last » Next »