Sciweavers

403 search results - page 18 / 81
» Frequent pattern mining with uncertain data
Sort
View
AUSAI
2003
Springer
14 years 1 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
14 years 2 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
JDWM
2010
139views more  JDWM 2010»
13 years 6 months ago
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
The Web is a continuously evolving environment, since its content is updated on a regular basis. As a result, the traditional usagebased approach to generate recommendations that ...
Panagiotis Giannikopoulos, Iraklis Varlamis, Magda...
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
14 years 1 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...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 8 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...