Sciweavers

798 search results - page 5 / 160
» Engineering graph clustering: Models and experimental evalua...
Sort
View
JCB
2002
160views more  JCB 2002»
14 years 9 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
CVPR
2010
IEEE
15 years 5 months ago
Authority-Shift Clustering: Hierarchical Clustering by Authority Seeking on Graphs
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
Minsu Cho (Seoul National University), Kyoung Mu L...
ISSTA
2007
ACM
14 years 11 months ago
Experimental assessment of random testing for object-oriented software
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
MODELS
2007
Springer
15 years 3 months ago
Scenario Integration via the Transformation and Manipulation of Higher-order Graphs
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
Hongzhi Liang
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
14 years 11 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...