1314 search results - page 182 / 263 » Approximate data mining in very large relational data |
141
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
161
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
167
click to vote
PVLDB
2011
14 years 11 months ago
2011
Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for soci...
129
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
213
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...