Sciweavers

7163 search results - page 437 / 1433
» Privacy-Preserving Data Mining
Sort
View
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
16 years 27 days ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
16 years 14 days ago
Optimizing Constraint-Based Mining by Automatically Relaxing Constraints
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
Arnaud Soulet, Bruno Crémilleux
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
16 years 27 days 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...
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
16 years 14 days ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
PAKDD
2010
ACM
203views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...