1314 search results - page 89 / 263 » Approximate data mining in very large relational data |
144
click to vote
ICDM
2002
IEEE
15 years 6 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
131
Voted
CAISE
2007
Springer
15 years 7 months ago
2007
Springer
Data cleaning is the process of correcting anomalies in a data source, that may for instance be due to typographical errors, or duplicate representations of an entity. It is a cruc...
113
click to vote
SAC
2009
ACM
15 years 8 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
122
Voted
KDD
2009
ACM
16 years 2 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
205
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
We study the problem of maintaining large replicated collections of files or documents in a distributed environment with limited bandwidth. This problem arises in a number of impo...