7150 search results - page 983 / 1430 » Graph-Based Data Mining |
142
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
137
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
138
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
121
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
128
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...