Sciweavers

131 search results - page 11 / 27
» On efficiently summarizing categorical databases
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingl...
Svetlana Lazebnik, Cordelia Schmid, Jean Ponce
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
14 years 9 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
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 7 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
ISBI
2004
IEEE
14 years 8 months ago
Grid-Enabled Automatic Construction of A Two-Chamber Cardiac PDM from a Large Database of Dynamic 3D Shapes
Point Distribution Modelling (PDM) is an efficient generative technique that can be used to incorporate statistical shape priors into image analysis methods like Active Shape Mode...
Alejandro F. Frangi, Loic Boisrobert, Marcos Lauce...
ICDE
2009
IEEE
173views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis wh...
Yueguo Chen, Gang Chen, Ke Chen, Beng Chin Ooi