Sciweavers

263 search results - page 10 / 53
» kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
Sort
View
ADC
2006
Springer
169views Database» more  ADC 2006»
15 years 3 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
15 years 3 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
ICCS
2009
Springer
15 years 4 months ago
Frequent Itemset Mining for Clustering Near Duplicate Web Documents
A vast amount of documents in the Web have duplicates, which is a challenge for developing efficient methods that would compute clusters of similar documents. In this paper we use ...
Dmitry I. Ignatov, Sergei O. Kuznetsov
KDD
2002
ACM
146views Data Mining» more  KDD 2002»
15 years 10 months ago
Closed Set Mining of Biological Data
We present a closed set data mining paradigm which is particularly e ective for uncovering the kind of deterministic, causal dependencies that characterize much of basic science. ...
John L. Pfaltz, Christopher M. Taylor
DAWAK
2004
Springer
15 years 3 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...