Sciweavers

587 search results - page 78 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
15 years 6 months ago
Sparse Kernel SVMs via Cutting-Plane Training
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
Thorsten Joachims, Chun-Nam John Yu
ICDM
2006
IEEE
129views Data Mining» more  ICDM 2006»
15 years 6 months ago
Getting the Most Out of Ensemble Selection
We investigate four previously unexplored aspects of ensemble selection, a procedure for building ensembles of classifiers. First we test whether adjusting model predictions to p...
Rich Caruana, Art Munson, Alexandru Niculescu-Mizi...
WWW
2010
ACM
15 years 6 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
CF
2006
ACM
15 years 1 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
INFOVIS
2003
IEEE
15 years 5 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...