Sciweavers

10457 search results - page 1839 / 2092
» Data Mapping as Search
Sort
View
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
16 years 7 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 7 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ICDE
2005
IEEE
185views Database» more  ICDE 2005»
16 years 7 months ago
A Multiresolution Symbolic Representation of Time Series
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Chr...
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 7 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 7 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
« Prev « First page 1839 / 2092 Last » Next »