Sciweavers

621 search results - page 69 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
TPDS
2008
199views more  TPDS 2008»
13 years 7 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 1 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 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
DIS
2007
Springer
13 years 12 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono