DMCA
Sampling algorithms for pure network topologies (2005)
Cached
Download Links
- [www.acm.org]
- [www.sigkdd.org]
- [www.sigkdd.org]
- [www.kdd.org]
- [www.people.fas.harvard.edu]
- [www.people.fas.harvard.edu]
- [www.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.dtic.mil]
Citations: | 23 - 4 self |
Citations
3931 | Emergence of scaling in random networks
- Barabási, Albert
- 1999
(Show Context)
Citation Context ...etwork topology” has recently gained attractiveness, as several complex phenomena of scientific interest tend to manifest in those networks that are characterized by specific “topological properties” =-=[19, 47, 5, 20, 9]-=-. Thus, it is not surprising to find that a fundamental characteristic shared by recent approaches to network analysis is the central role played by a set of basic types of networks, identified by spe... |
3612 |
Social network analysis: methods and applications. Structural analysis in the social sciences, 8
- Wasserman, Faust
- 1994
(Show Context)
Citation Context ...ncy. 44. Connectedness. 45. Hierarchy. 46. Upper boundedness. 47. Average distance. 48-51. All pairs shortest path (min, max, avg, std). Formal definitions are available in Wasserman and Faust (1994) =-=[46]-=-. The metrics above are available in ORA [13]. 4.2 Design of Experiments Overall, the hypotheses we wish to test are: (1) stability, i.e., to what extent different sampling algorithms for the same pur... |
3323 |
Collective dynamics of smallworld’networks
- Watts, Stogatz
- 1998
(Show Context)
Citation Context ...etwork topology” has recently gained attractiveness, as several complex phenomena of scientific interest tend to manifest in those networks that are characterized by specific “topological properties” =-=[19, 47, 5, 20, 9]-=-. Thus, it is not surprising to find that a fundamental characteristic shared by recent approaches to network analysis is the central role played by a set of basic types of networks, identified by spe... |
3062 | On random graphs
- ERDÖS, RÉNYI
- 1959
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
2594 | The structure and function of complex networks
- Newman
- 2003
(Show Context)
Citation Context ... separability of the sampling algorithms surveyed or introduced in section 3.1. 2.1 Related Work The pure topology types we consider in the next section have been introduced separately over the years =-=[19, 38, 47, 5, 20, 9, 4, 39, 22]-=-. To the best of our knowledge neither exploratory nor compre1 The reference space used in this paper is defined by 47 metrics widely adopted in the social and physical sciences. We embed all sampled ... |
2385 | Random Graphs
- Bollobás
- 2001
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
2143 | Statistical mechanics of complex networks
- Albert, Barabási
- 2002
(Show Context)
Citation Context ... separability of the sampling algorithms surveyed or introduced in section 3.1. 2.1 Related Work The pure topology types we consider in the next section have been introduced separately over the years =-=[19, 38, 47, 5, 20, 9, 4, 39, 22]-=-. To the best of our knowledge neither exploratory nor compre1 The reference space used in this paper is defined by 47 metrics widely adopted in the social and physical sciences. We embed all sampled ... |
1666 | On power-law relationships of the Internet topology
- Faloutsos, Faloutsos, et al.
- 1999
(Show Context)
Citation Context ...etwork topology” has recently gained attractiveness, as several complex phenomena of scientific interest tend to manifest in those networks that are characterized by specific “topological properties” =-=[19, 47, 5, 20, 9]-=-. Thus, it is not surprising to find that a fundamental characteristic shared by recent approaches to network analysis is the central role played by a set of basic types of networks, identified by spe... |
990 | Maximizing the spread of influence through a social network
- KEMPE, KLEINBERG, et al.
- 2003
(Show Context)
Citation Context ... e.g., sub-samples of scale free networks are not scale free [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks =-=[33, 34, 32, 1]-=-, at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3... |
613 | Learning probabilistic relational models
- Friedman, Getoor, et al.
- 1999
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
537 | Graphs over time: densification laws, shrinking diameters and possible explanations
- Leskovec, Kleinberg, et al.
- 2005
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
373 | The Web as a graph: Measurements, Models, and Methods
- Kleinberg, Kumar, et al.
- 1999
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
285 |
Navigation in a small world.
- Kleinberg
- 2000
(Show Context)
Citation Context ... e.g., sub-samples of scale free networks are not scale free [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks =-=[33, 34, 32, 1]-=-, at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3... |
252 |
Structural equivalence of individuals in social networks.
- Lorrain, White
- 1971
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
186 | Graph-based data mining.
- Cook, Holder
- 2000
(Show Context)
Citation Context ...nic texts have made available huge amount of “networked data,” to the data mining community at large, to the effect that models and algorithms for network analysis have become a central theme for KDD =-=[29, 15, 18, 24, 28]-=- On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now [19, 37, 10, 21, 6, 7, 12, 11]. Over the years, the com... |
176 | Small-world phenomena and the dynamics of information.
- Kleinberg
- 2002
(Show Context)
Citation Context ... e.g., sub-samples of scale free networks are not scale free [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks =-=[33, 34, 32, 1]-=-, at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3... |
158 | How to Search a Social Network.
- Adamic, Adar
- 2005
(Show Context)
Citation Context ... e.g., sub-samples of scale free networks are not scale free [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks =-=[33, 34, 32, 1]-=-, at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3... |
154 | Models of core/periphery structures
- Borgatti, Everett
- 1999
(Show Context)
Citation Context ...etwork topology” has recently gained attractiveness, as several complex phenomena of scientific interest tend to manifest in those networks that are characterized by specific “topological properties” =-=[19, 47, 5, 20, 9]-=-. Thus, it is not surprising to find that a fundamental characteristic shared by recent approaches to network analysis is the central role played by a set of basic types of networks, identified by spe... |
135 | Why collective inference improves relational classification
- Jensen, Neville, et al.
- 2004
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
131 |
Subnets of scale-free networks are not scale-free: Sampling properties of networks
- Stumpf, Wiuf, et al.
- 2005
(Show Context)
Citation Context ...oviding intuitions and mathematical theory that describe what happens to topological properties when only partial information is available, e.g., sub-samples of scale free networks are not scale free =-=[43]-=-, at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks [33, 34, 32, 1], at developing models of information flow [41, 42... |
127 | Probabilistic classification and clustering in relational data
- Taskar, Segal, et al.
- 2001
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
110 |
An algorithm for clustering relational data with applications to social network analysis and comparison to multidimensional scaling.
- Breiger, Boorman, et al.
- 1975
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
91 |
Methods for identifying names and ontological relations in text using heuristics for inducing regularities from data. http:// minorthird.sourceforge.net.
- Cohen
- 2004
(Show Context)
Citation Context ...ifiers, such as naïve Bayes (based on Multinomial and Poisson distributions), logistic regression, maximum entropy, SVM (with a linear kernel), voted perceptron, decision trees and k-nearest neighbor =-=[14]-=-. The results below correspond to the Poisosn flavor of naïve Bayes classifier that turned out to be more accurate in predicting the topology type of a given network [3]. In order to estimate the pred... |
82 |
The nature of the social agent
- Carley, Newell
- 1994
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
82 | Statistical analysis of multiple sociometric relations,
- Fienberg, Meyer, et al.
- 1985
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
76 | On the robustness of centrality measures under conditions of imperfect data.
- Borgatti, Carley, et al.
- 2006
(Show Context)
Citation Context ...34, 32, 1], at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties =-=[23, 8]-=-. 3 Pure Topology Types We begin with a heuristic description of the pure topology types. The sampling algorithms in the next section provide these intuitive notions with a precise meaning. Without lo... |
65 |
analysis, eigenvectors, and stability
- Link
- 2001
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
53 |
Smart Agents and Organizations of the Future',
- Carley
- 2002
(Show Context)
Citation Context ...ave become a central theme for KDD [29, 15, 18, 24, 28] On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now =-=[19, 37, 10, 21, 6, 7, 12, 11]-=-. Over the years, the communication across communities has increased, the major results of each discipline have been shared and assimilated by the others, and, occasionally, old ideas have resurfaced ... |
48 | Discovering latent classes in relational data
- Kemp, Griffiths, et al.
- 2004
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
45 | Group and topic discovery from relations and text
- Wang, Mohanty, et al.
- 2005
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
40 |
mining: a new data mining challenge
- Link
(Show Context)
Citation Context ...nic texts have made available huge amount of “networked data,” to the data mining community at large, to the effect that models and algorithms for network analysis have become a central theme for KDD =-=[29, 15, 18, 24, 28]-=- On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now [19, 37, 10, 21, 6, 7, 12, 11]. Over the years, the com... |
38 |
Prospects and challenges for multi-relational data mining
- Domingos
(Show Context)
Citation Context ...nic texts have made available huge amount of “networked data,” to the data mining community at large, to the effect that models and algorithms for network analysis have become a central theme for KDD =-=[29, 15, 18, 24, 28]-=- On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now [19, 37, 10, 21, 6, 7, 12, 11]. Over the years, the com... |
36 |
Informational Exchange and the Robustness of Organizational Networks," Periodical for the National Academy of Sciences, Volume 100
- Dodds, Watts, et al.
- 2003
(Show Context)
Citation Context ...eness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks [33, 34, 32, 1], at developing models of information flow [41, 42] and information exchange =-=[16]-=-, or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3 Pure Topology Types We begin with a heuristic description of the pure topology t... |
26 | Statistical challenges to inductive inference in linked data
- Jensen
- 1999
(Show Context)
Citation Context ...nic texts have made available huge amount of “networked data,” to the data mining community at large, to the effect that models and algorithms for network analysis have become a central theme for KDD =-=[29, 15, 18, 24, 28]-=- On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now [19, 37, 10, 21, 6, 7, 12, 11]. Over the years, the com... |
16 |
S.E.: A latent mixed-membership model for relational data. In:
- Airoldi, Blei, et al.
- 2005
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
14 | Graph-based relational learning: Current and future directions
- Holder, Cook
(Show Context)
Citation Context ...nic texts have made available huge amount of “networked data,” to the data mining community at large, to the effect that models and algorithms for network analysis have become a central theme for KDD =-=[29, 15, 18, 24, 28]-=- On the other hand, in the social and mathematical sciences, (social and complex) networks have been an object of research for a few decades now [19, 37, 10, 21, 6, 7, 12, 11]. Over the years, the com... |
12 | 2003, “Estimating the Shape of Covert Networks
- Dombroski, Fischbeck, et al.
(Show Context)
Citation Context ...only used for network analysis. Typing network topologies form data is a fairly novel area of research. Initial explorations are present in specific application domains such as cover network analysis =-=[17]-=-. Related research efforts aim at providing intuitions and mathematical theory that describe what happens to topological properties when only partial information is available, e.g., sub-samples of sca... |
12 |
Computational aspects of organization theory
- Papadimitriou
- 1997
(Show Context)
Citation Context ...ee [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks [33, 34, 32, 1], at developing models of information flow =-=[41, 42]-=- and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3 Pure Topology Types We begin with a heuristic desc... |
11 | A Formal Characterization of Cellular Networks No. CmuIsri-05-109. Carnegie-Mellon and
- Frantz, Carley
- 2005
(Show Context)
Citation Context ... separability of the sampling algorithms surveyed or introduced in section 3.1. 2.1 Related Work The pure topology types we consider in the next section have been introduced separately over the years =-=[19, 38, 47, 5, 20, 9, 4, 39, 22]-=-. To the best of our knowledge neither exploratory nor compre1 The reference space used in this paper is defined by 47 metrics widely adopted in the social and physical sciences. We embed all sampled ... |
11 |
Learning probabilistic models with link uncertainty
- Getoor, Friedman, et al.
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
9 | Relating network topology to the robustness of centrality measures,
- Frantz, Carley
- 2005
(Show Context)
Citation Context ...34, 32, 1], at developing models of information flow [41, 42] and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties =-=[23, 8]-=-. 3 Pure Topology Types We begin with a heuristic description of the pure topology types. The sampling algorithms in the next section provide these intuitive notions with a precise meaning. Without lo... |
6 |
Bayesian models for frequent terms in text
- Airoldi, Cohen, et al.
- 2005
(Show Context)
Citation Context ...In data mining and machine learning, the study of real world networks is essential for the development of sound theoretical models, which ultimately lead to unbiased inferences and robust predictions =-=[35, 40, 44, 25, 26, 30, 36, 2, 45, 31, 3]-=-. Analyses of real networks rely upon two crucial tasks: (1) that of “generating,” or “sampling,” networks that display realistic properties of interest, and (2) that of “determining” which pure topol... |
6 | The origins of the deadline: Optimizing communication in organizations
- Papadimitriu, Servan-Schreiber
- 1999
(Show Context)
Citation Context ...ee [43], at exploring the effectiveness of search strategies, e.g., greedy search finds short chains of acquaintances in small world networks [33, 34, 32, 1], at developing models of information flow =-=[41, 42]-=- and information exchange [16], or at exploring the robustness of metrics for network analysis to variations in the topological properties [23, 8]. 3 Pure Topology Types We begin with a heuristic desc... |
4 |
The small world phenomenon
- Milgram
- 1967
(Show Context)
Citation Context ...local acquaintances, few of which relocate to places far away.” This stylized model of behavior is enough to replicate the phenomenon observed by Milgram, and it “sounds” like a plausible explanation =-=[38, 47]-=-. In section 3.1 we address the following problem. Problem 1 (Sampling) How can we generate topologies that have a set of desired properties with high probability? Sampling algorithms can be both dete... |
3 |
ORA: Organizational Risk Analyzer, 2004. Available for download at http://www.casos.cs.cmu.edu/projects/ora
- Carley, Reminga
(Show Context)
Citation Context ...e introduce novel algorithms aimed at enhancing the diversity of sam5spled networks, and at addressing the case of cellular topology type. The following algorithms are available in C++ as part of ORA =-=[13]-=-. 3.1.1 Ring Lattice A ring lattice with parameters (n,k) is sampled as follows. Ring Lattice 1 Define n as the number of nodes in the graph, and k as the number of neighbors for each node. Given (n,k... |