Sciweavers

2463 search results - page 350 / 493
» Compressing Pattern Databases
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 15 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 10 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 10 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 10 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
RULES
1993
Springer
134views Database» more  RULES 1993»
14 years 2 months ago
Temporal Rule Specification and Management in Object-oriented Knowledge Bases
There have been many recent research efforts on temporal databases for managing current and historical data and on active databases for monitoring real-world events as well as dat...
Stanley Y. W. Su, Hsin-Hsing M. Chen