Link Clustering Research Articles

An assessment of blockchain academia and news developments: a bibliometric and text-mining analysis

PurposeThis study aims to provide a more complete picture of blockchain development by combining numerous methodologies with diverse data sources, such as academic papers and news articles. This study displays the developmental status of each subject based on the interrelationships of each topic cluster by analyzing high-frequency keywords extracted from the collected data. Moreover, applying above methodologies will help understanding top research topics, authors, venues, institutes and countries. The differences of blockchain research and new are identified.Design/methodology/approachTo identify and find blockchain development linkages, researchers have used search terms such as co-occurrence, bibliographic coupling, co-citation and co-authorship to help us understand the top research topics, authors, venues, institutes and countries. This study also used text mining analysis to identify blockchain articles' primary concepts and semantic structures.FindingsThe findings show the fundamental topics based on each topic cluster's links. While “technology”, “transaction”, “privacy and security”, “environment” and “consensus” were most strongly associated with blockchain in research, “platform”, “big data and cloud”, “network”, “healthcare and business” and “authentication” were closely tied to blockchain news. This article classifies blockchain principles into five patterns: hardware and infrastructure, data, networking, applications and consensus. These statistics helped the authors comprehend the top research topics, authors, venues, publication institutes and countries.Research limitations/implicationsSince Web of Science (WoS) and LexisNexis Academic data are used, the study has few sources. Others advise merging foreign datasets. WoS is one of the world's largest and most-used databases for assessing scientific papers.Originality/valueThis study has several uses and benefits. First, key concept discoveries can help academics understand blockchain research trends so they can prioritize research initiatives. Second, bibliographic coupling links academic papers on blockchain. It helps information seekers search and classify the material. Co-citation analysis results can help researchers identify potential partners and leaders in their field. The network's key organizations or countries should be proactive in discovering, proposing and creating new relationships with other organizations or countries, especially those from the journal network's border, to make the overall network more integrated and linked. Prominent members help recruit new authors to organizations or countries and link them to the co-authorship network. This study also used concept-linking analysis to identify blockchain articles' primary concepts and semantic structures. This may lead to new authors developing research ideas or subjects in primary disciplines of inquiry.

A link density clustering algorithm based on automatically selecting density peaks for overlapping community detection

In this paper, we proposed a link density clustering (LDC) method for overlapping community detection based on density peaks. We firstly use an extended cosine link distance metric to reflect the relationship of links. Then we introduce a clustering algorithm with fast search for solving the link clustering (LC) problem by density peaks with box plot strategy to determine the cluster centers automatically. Finally, we acquire both the link communities and the node communities. Our algorithm is compared with other representative algorithms through substantial experiments on real-world networks. The experimental results show that our algorithm consistently outperforms other algorithms in terms of modularity and coverage.

Link Clustering with Extended Link Similarity and EQ Evaluation Division

Link Clustering (LC) is a relatively new method for detecting overlapping communities in networks. The basic principle of LC is to derive a transform matrix whose elements are composed of the link similarity of neighbor links based on the Jaccard distance calculation; then it applies hierarchical clustering to the transform matrix and uses a measure of partition density on the resulting dendrogram to determine the cut level for best community detection. However, the original link clustering method does not consider the link similarity of non-neighbor links, and the partition density tends to divide the communities into many small communities. In this paper, an Extended Link Clustering method (ELC) for overlapping community detection is proposed. The improved method employs a new link similarity, Extended Link Similarity (ELS), to produce a denser transform matrix, and uses the maximum value of EQ (an extended measure of quality of modularity) as a means to optimally cut the dendrogram for better partitioning of the original network space. Since ELS uses more link information, the resulting transform matrix provides a superior basis for clustering and analysis. Further, using the EQ value to find the best level for the hierarchical clustering dendrogram division, we obtain communities that are more sensible and reasonable than the ones obtained by the partition density evaluation. Experimentation on five real-world networks and artificially-generated networks shows that the ELC method achieves higher EQ and In-group Proportion (IGP) values. Additionally, communities are more realistic than those generated by either of the original LC method or the classical CPM method.