Sciweavers

78 search results - page 15 / 16
» Suggesting friends using the implicit social graph
Sort
View
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 6 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
CEC
2007
IEEE
13 years 9 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
CSCW
2004
ACM
13 years 11 months ago
Learning from project history: a case study for software development
The lack of lightweight communication channels and other technical and sociological difficulties make it hard for new members of a non-collocated software development team to lea...
Davor Cubranic, Gail C. Murphy, Janice Singer, Kel...
BMCBI
2010
176views more  BMCBI 2010»
13 years 5 months ago
Bayesian statistical modelling of human protein interaction network incorporating protein disorder information
Background: We present a statistical method of analysis of biological networks based on the exponential random graph model, namely p2-model, as opposed to previous descriptive app...
Svetlana Bulashevska, Alla Bulashevska, Roland Eil...
CIKM
2009
Springer
14 years 10 days ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...