Sciweavers

587 search results - page 92 / 118
» Clustering Improves the Exploration of Graph Mining Results
Sort
View
ANTSW
2004
Springer
15 years 9 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
HT
2010
ACM
15 years 11 months ago
Community-based ranking of the social web
The rise of social interactions on the Web requires developing new methods of information organization and discovery. To that end, we propose a generative community-based probabil...
Said Kashoob, James Caverlee, Krishna Kamath
BMCBI
2005
163views more  BMCBI 2005»
15 years 6 months ago
Alkahest NuclearBLAST: a user-friendly BLAST management and analysis system
Background -: Sequencing of EST and BAC end datasets is no longer limited to large research groups. Drops in per-base pricing have made high throughput sequencing accessible to in...
Stephen E. Diener, Thomas D. Houfek, Sam E. Kalat,...
ICCV
2007
IEEE
16 years 12 days ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
15 years 8 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang