1314 search results - page 178 / 263 » Approximate data mining in very large relational data |
124
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
With the new interest in historical documents insight grew that electronic access to these texts causes many specific problems. In the first part of the paper we survey the presen...
153
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
176
click to vote
IOR
2011
14 years 11 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
284
click to vote
TMA
2012
Springer
14 years 8 hour ago
2012
Springer
Large-scale network monitoring systems require efficient storage and consolidation of measurement data. Relational databases and popular tools such as the Round-Robin Database sho...
144
click to vote
JMLR
2010
14 years 11 months ago
2010
Matrix factorization is a successful technique for building collaborative filtering systems. While it works well on a large range of problems, it is also known for requiring signi...