Sciweavers

1861 search results - page 151 / 373
» Pattern Databases
Sort
View
PODS
2003
ACM
151views Database» more  PODS 2003»
16 years 3 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
16 years 4 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 9 months ago
Optimization of Query Plans in the presence of Access Limitations
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...
Andrea Calì, Diego Calvanese, Davide Martin...
ICML
2009
IEEE
16 years 4 months ago
Ranking interesting subgroups
Subgroup discovery is the task of identifying the top k patterns in a database with most significant deviation in the distribution of a target attribute Y . Subgroup discovery is ...
Stefan Rueping
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
15 years 9 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You