Sciweavers

295 search results - page 39 / 59
» Frequent regular itemset mining
Sort
View
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 10 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
CIKM
2006
Springer
13 years 11 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...
DEXA
2004
Springer
153views Database» more  DEXA 2004»
14 years 1 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
ICA3PP
2005
Springer
14 years 1 months ago
Mining Traces of Large Scale Systems
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Christophe Cérin, Michel Koskas
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
14 years 29 days ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz