1403 search results - page 34 / 281 » Set cover algorithms for very large datasets |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ESANN
2008
13 years 10 months ago
2008
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
IGARSS
2009
13 years 6 months ago
2009
Supervised learners can be used to automatically classify many types of spatially distributed data. For example, land cover classification by hyperspectral image data analysis is ...
CIKM
2009
Springer
13 years 6 months ago
2009
Springer
In this paper, we present a framework for mining diverging patterns, a new type of contrast patterns whose frequency changes significantly differently in two data sets, e.g., it c...