Sciweavers

159 search results - page 6 / 32
» Small world models for social network algorithms testing
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 28 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 8 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
HICSS
2011
IEEE
238views Biometrics» more  HICSS 2011»
12 years 11 months ago
Smoking Behavior and Friendship Formation: The Importance of Time Heterogeneity in Studying Social Network Dynamics
—This study illustrates the importance of assessing and accounting for time heterogeneity in longitudinal social network analysis. We apply the time heterogeneity model selection...
Joshua Alfred Lospinoso, Danielle J. Satchell
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 6 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 2 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios