The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The study of world city networks becomes one of the hottest research areas. Mining the important nodes has been important research questions in network evaluation of world city applications. In this paper, we firstly summarized the characteristics of world city network and evaluated their centrality and power of control. Then, the node importance evaluation methods based on network topologies were...
Many universities are working to improve their graduation rates. The factors that correlate to student success and hence graduation rates are many, varying from pre-institutional factors, including high school GPA and admissions scores, to institutional factors, including student support services and the quality of faculty. An essential institutional factor that is often overlooked is the structure...
Recently, there have been many advances in the research underlying condensed co-change graph, but most research has focused on the discovery of the graph feature. There still few works have done with consideration that the mass unchanged artifacts profoundly effect on the clustering. This paper presents a method for constructing more accurate condensed co-change graph. By using random walk, all the...
Two common ways of network comparison are global property statistics and subgraph enumeration. However, they have unique traits, some advantages and some disadvantages. Global property of networks is easy to compute, but can only provide limited information; the subgraph-based method can extract essential structure of the studied networks, but for large networks, the exhaustible computing make subgraph...
Systems such as proteins, chemical compounds, and the Internet are being modeled as complex networks to identify local and global characteristics of the system. In many instances, these graphs are very large in size presenting challenges in their analysis. Hence, graph indexing techniques are developed to enhance various graph mining algorithms. In this paper, we propose a new Structural Graph Indexing...
Traditional algorithm in Community identification take full advantage of vertex. But in these algorithms, node's aggregation characteristics are not obvious and the quantity of communities is not reasonable. The edge of the spectral decomposition algorithm (ESDA) is different from traditional method for community partition. There are four steps in ESDA: first, we translate the origin graph into line...
Hypergraph partitioning has been considered as a promising method to address the challenges of high dimensionality in clustering. Many complex networks possess the scale-free property, which makes the task of community discobery from these networks difficult. In this paper we present a method of detecting community structure based on hypergraph model to address this problem. The hypergraph model maps...
The question of finding the community structure of a complex network has been addressed in many different ways. Here we utilize a clustering method called affinity propagation, associating with some existent measures on graphs, such as the shortest path, the diffusion distance and the dissimilarity index, to solve the network partitioning problem. This method considers all nodes as potential exemplars,...
Design thinking, as a complex system, can be described as complex network. We constructed design thinking networks from analysing verbal protocols acquired form a design experiment conducted with think-aloud method. The characteristic path length and the clustering coefficient of the design thinking networks were calculated and compared with that of the equivalent random graphs. Result indicates that...
In this paper we face some relevant issues on the relations between Web communities and ontologies. We build an operator that constructs a weak Web community, according to the definition given in,starting from a seed of Web sites. The necessity of such an operator is derived from a problem arisen in the model developed in, in which some relevant concepts in automotive oriented ontology were not given...
Complex adaptive system (CAS) theory is used to analyze the e-commerce system and the concept of e-commerce transaction network is proposed. The e-commerce transaction network can be viewed as a complex network which is constructed by transaction behaviors between buyers and sellers. Then we give a formal definition of the e-commerce transaction network and establish a multi-agent model for e-commerce...
With the continuous expansion of the network size, some networks gradually present the characteristics of social networks, especially, scale-free networks. At present, some theoretical studies of scale-free networks are mainly based on simulated platforms. Based on this, the question that how we fast simulate a network model possessing scale-free effects and presenting related characteristics of realistic...
A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost complete subgraphs of a graph. In sparse and very large scale-free networks, the problem of finding the...
The epidemic spread is definitely connected to the human social relationships and activities, and as a typical complex network, social network could be used to describe the relationships and activities between human beings. This paper proposed the recovery method for the incomplete relationship data in real complex social network according to statistical sampling. The epidemic spread model based on...
We focus on bus transport networks (BTNs), because buses are the main public transportation tool in China. In this paper, we present the empirical investigation results on the urban bus transport networks (BTNs) of four major cities in middle China. In BTNs, nodes are bus stops. Two nodes are connected by an edge when the stops are serviced by a common bus route. Comparing with the developed cities...
Complex data can often be represented in terms of random graphs or networks. Important features of real world networks can be described by a special class of random graphs called small-world networks. Small-world networks emerge in many contexts, from systems biology to distributed technological systems. Here we ask how the functional and structural properties of specialized real world networks are...
This paper describes an extension to stochastic Kronecker graphs that provides the special structure required for searchability, by defining a ??distance??-dependent Kronecker operator. We show how this extension of Kronecker graphs can generate several existing social network models, such as the Watts-Strogatz small-world model and Kleinberg's lattice-based model. We focus on a specific example of...
The brain is a complex biological system with dynamic interactions between its sub-systems. One particular challenge in the study of this complex system is the identification of dynamic functional networks underlying observed neural activity. The interactions between different neural activity are quantified through measures of functional connectivity such as the phase synchrony measure. In previous...
Barabasi and Albert find that many large networks exhibit a scale-free power-law distribution of vertex degrees. We show that when vertex degrees of large networks follow a scale-free power-law distribution with the exponent gamma ges 2, the number of degree-1 vertices, when nonzero, is of the same order as the network size N and that the average degree is of order less than log N. Furthermore, let...
The self-similarity of complex networks has broad practical backgrounds, yet the self-similarity of network has been rarely studied. One of the problems is to explore the origination of self-similarity in real networks. For this purpose, we proposed the information transfer model in network. The volume dimension integrating the information transfer model is given to analysis the self-similarity of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.