1314 search results - page 104 / 263 » Approximate data mining in very large relational data |
129
Voted
MP
2010
15 years 4 days ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
118
Voted
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
121
click to vote
KDD
1998
ACM
15 years 6 months ago
1998
ACM
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
118
click to vote
ESANN
2008
15 years 3 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
163
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...