Sciweavers

181 search results - page 30 / 37
» Mining, indexing, and querying historical spatiotemporal dat...
Sort
View
CIKM
2007
Springer
14 years 1 months ago
Top-k subgraph matching query in a large graph
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...
Lei Zou, Lei Chen 0002, Yansheng Lu
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 6 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
DAWAK
2001
Springer
14 years 6 days ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
CIKM
2005
Springer
14 years 1 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
12 years 3 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...