1314 search results - page 102 / 263 » Approximate data mining in very large relational data |
141
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
102
click to vote
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Triggered by a market relevant application that involves making joint predictions of pedestrian and public transit flows in urban areas, we address the question of how to utili...
107
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
103
click to vote
CIKM
1999
Springer
15 years 6 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
138
click to vote
TNN
2008
15 years 1 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...