Sciweavers

464 search results - page 30 / 93
» Frequent pattern mining for kernel trace data
Sort
View
RCIS
2010
13 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 1 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
ICDM
2002
IEEE
114views Data Mining» more  ICDM 2002»
14 years 2 months ago
Online Algorithms for Mining Semi-structured Data Stream
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Ka...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
14 years 1 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
14 years 3 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...