Sciweavers

1414 search results - page 241 / 283
» Relational peculiarity-oriented mining
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 6 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
WWW
2010
ACM
14 years 3 months ago
Sampling community structure
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Arun S. Maiya, Tanya Y. Berger-Wolf
SAC
2010
ACM
14 years 3 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
ISPASS
2009
IEEE
14 years 3 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
WCRE
2009
IEEE
14 years 3 months ago
Who are Source Code Contributors and How do they Change?
—Determining who are the copyright owners of a software system is important as they are the individuals and organizations that license the software to its users, and ultimately t...
Massimiliano Di Penta, Daniel M. Germán