Sciweavers

122 search results - page 2 / 25
» An Efficient Algorithm for Mining String Databases Under Con...
Sort
View
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 5 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
BMCBI
2010
149views more  BMCBI 2010»
13 years 5 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
13 years 10 months ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 6 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis