Sciweavers

CIKM
2006
Springer
13 years 8 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...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
13 years 10 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
13 years 10 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
13 years 10 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li