768 search results - page 93 / 154 » Efficient Correlation Search from Graph Databases |
202
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
158
click to vote
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
134
click to vote
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
224
click to vote
AAAI
2010
15 years 4 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
135
click to vote
AAAI
1990
15 years 4 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...