Sciweavers

289 search results - page 37 / 58
» Node similarity in the citation graph
Sort
View
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 9 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
ICWSM
2009
13 years 5 months ago
Content Based Recommendation and Summarization in the Blogosphere
This paper presents a stochastic graph based method for recommending or selecting a small subset of blogs that best represents a much larger set. within a certain topic. Each blog...
Ahmed Hassan, Dragomir R. Radev, Junghoo Cho, Amru...
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
CICLING
2010
Springer
14 years 2 months ago
An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
George Tsatsaronis, Iraklis Varlamis, Kjetil N&osl...