1778 search results - page 266 / 356 » The Theory of Probabilistic Databases |
149
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
136
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
123
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
133
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
124
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...