Sciweavers

3245 search results - page 139 / 649
» Mining Transformed Data Sets
Sort
View
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
16 years 1 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...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 7 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
15 years 11 months ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
WWW
2009
ACM
16 years 6 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 9 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...