1314 search results - page 96 / 263 » Approximate data mining in very large relational data |
99
Voted
KDD
2003
ACM
16 years 2 months ago
2003
ACM
The growth of bioinformatics has resulted in datasets with new characteristics. These datasets typically contain a large number of columns and a small number of rows. For example,...
139
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
136
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
130
click to vote
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
124
click to vote
NLE
2008
15 years 1 months ago
2008
Being able to identify which rhetorical relations (e.g., contrast or explanation) hold between spans of text is important for many natural language processing applications. Using ...