a novel measure is proposed to determine the similarity of each pair of nodes based on the number of common neighbours and correlation between the neighbourhood vectors of the nodes Experimental results, on a range of different real-world networks, suggest that the proposed method results in higher...
On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we define a basic node similarity measure that captures effectively local graph features. We also exploit global ...
Computer Science - Social and Information NetworksIn many applications, we need to measure similarity between nodes in a large network based on features of their neighborhoods. Although in-network node similarity based on proximity has been well investigated, surprisingly, measuring in-network node ...
Once a community structure is found, we rank nodes in decreasing order according to the community Hub-Bridge centrality measure (Eq. 13) for retaining the top-k of the ranked list. Particularly, the top 1000 exposes densely connected groups of nodes like cliques, which are defined to be ...
In our study, several models are tested and a combination of the basic Text-CNN model and the Linear SVC model has been proved to be effective. Second, we introduce a complete framework of social network data processing for emergency event detection, which integrates classification and attribute ...
In this paper, a novel cosine similarity-based clustering and dynamic reputation trust aware key generation (CSBC-DRT) scheme is proposed. For better faced clustering, a cosine similarity measure is estimated for all the nodes on the network. Based on the similarity measure among the nodes, the...
A semantic similarity measure for linked data: An information content-based approach Meymandpour, Rouzbeh,Davis, Joseph G - Knowledge-Based S... - 2016 - 被引量: 19 Automatic Assessment Technology Based on Domain-specific Concept ...
Measuring object similarity in a graph is a fundamental data- mining problem in various application domains, including Web linkage mining, social network analysis, information retrieval, and recommender systems. In this paper, we focus on the neighbor-based approach that is based on the intuition th...
In addition the stop criterion of label propagation is only a condition and not a measure that should be optimized. To date, most community detection algorithms have limitations and there is still room for improvement. In this paper, we investigate a fast and simple algorithm that uses the ...
The social connections contain information in the network that allows a party to make a more informed decision (e.g., Scharfstein and Stein, 1990; Banerjee, 1992). In contrast to these studies, our social networks measure primarily captures the information role of social media. By using this ...