Sciweavers

304 search results - page 46 / 61
» Mining query subtopics from search log data
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 10 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 9 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
75
Voted
ECML
2001
Springer
15 years 2 months ago
Mining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Abstract. This paper presents a simple unsupervised learning algorithm for recognizing synonyms, based on statistical data acquired by querying a Web search engine. The algorithm, ...
Peter D. Turney
BMCBI
2006
147views more  BMCBI 2006»
14 years 9 months ago
QPath: a method for querying pathways in a protein-protein interaction network
Background: Sequence comparison is one of the most prominent tools in biological research, and is instrumental in studying gene function and evolution. The rapid development of hi...
Tomer Shlomi, Daniel Segal, Eytan Ruppin, Roded Sh...