Sciweavers

2121 search results - page 350 / 425
» Indexing Incomplete Databases
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 8 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
VLDB
2004
ACM
95views Database» more  VLDB 2004»
15 years 8 months ago
Combating Web Spam with TrustRank
Web spam pages use various techniques to achieve higher-than-deserved rankings in a search engine’s results. While human experts can identify spam, it is too expensive to manual...
Zoltán Gyöngyi, Hector Garcia-Molina, ...
VLDB
2004
ACM
143views Database» more  VLDB 2004»
15 years 8 months ago
GPX: Interactive Mining of Gene Expression Data
Discovering co-expressed genes and coherent expression patterns in gene expression data is an important data analysis task in bioinformatics research and biomedical applications. ...
Daxin Jiang, Jian Pei, Aidong Zhang
126
Voted
XSYM
2004
Springer
115views Database» more  XSYM 2004»
15 years 8 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
15 years 8 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu