Sciweavers

464 search results - page 48 / 93
» Frequent pattern mining for kernel trace data
Sort
View
MDAI
2010
Springer
14 years 11 months ago
Pattern Mining on Stars with FP-Growth
Abstract. Most existing data mining (DM) approaches look for patterns in a single table. Multi-relational DM approaches, on the other hand, look for patterns that involve multiple ...
Andreia Silva, Cláudia Antunes
ICML
2007
IEEE
16 years 2 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 4 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...
PVLDB
2008
107views more  PVLDB 2008»
15 years 26 days ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
CIKM
2006
Springer
15 years 5 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...