Sciweavers

960 search results - page 131 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
269
Voted
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 5 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
GIS
2006
ACM
16 years 4 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
SDM
2003
SIAM
183views Data Mining» more  SDM 2003»
15 years 5 months ago
ApproxMAP: Approximate Mining of Consensus Sequential Patterns
Conventional sequential pattern mining methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivi...
Hye-Chung Kum, Jian Pei, Wei Wang 0010, Dean Dunca...
142
Voted
BMCBI
2006
117views more  BMCBI 2006»
15 years 3 months ago
G-InforBIO: integrated system for microbial genomics
Background: Genome databases contain diverse kinds of information, including gene annotations and nucleotide and amino acid sequences. It is not easy to integrate such information...
Naoto Tanaka, Takashi Abe, Satoru Miyazaki, Hideak...
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
16 years 5 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...