Sciweavers

104 search results - page 3 / 21
» TRIPS and TIDES: new algorithms for tree mining
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
WWW
2006
ACM
14 years 6 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
14 years 6 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
13 years 8 months ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 5 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...