Sciweavers

321 search results - page 5 / 65
» Additive Pattern Database Heuristics
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
CONSTRAINTS
1998
62views more  CONSTRAINTS 1998»
13 years 7 months ago
Learning Game-Specific Spatially-Oriented Heuristics
This paper describes an architecture that begins with enough general knowledge to play any board game as a novice, and then shifts its decision-making emphasis to learned, game-sp...
Susan L. Epstein, Jack Gelfand, Esther Lock
TKDE
2008
218views more  TKDE 2008»
13 years 7 months ago
A General Model for Sequential Pattern Mining with a Progressive Database
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
Jen-Wei Huang, Chi-Yao Tseng, Jian Chih Ou, Ming-S...
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 5 months ago
Querying spatial patterns
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Si...
CIKM
2008
Springer
13 years 9 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...