Sciweavers

391 search results - page 5 / 79
» Efficient Data Mining for Path Traversal Patterns
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 1 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
HICSS
2000
IEEE
155views Biometrics» more  HICSS 2000»
14 years 4 days ago
Mining Time Dependency Patterns in Clinical Pathways
Clinical pathways are widely adopted by many large hospitals around the world in order to provide high-quality patient treatment and reduce the length of hospital stay of each pat...
Fu-ren Lin, Shien-chao Chou, Shung-mei Pan, Yao-me...
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 2 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
WWW
2008
ACM
14 years 8 months ago
Efficient evaluation of generalized path pattern queries on XML data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
Xiaoying Wu, Stefanos Souldatos, Dimitri Theodorat...