• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2587-2605
• /
• 2022

In order to efficiently detect community structure in complex networks, community detection algorithms can be designed from the perspective of node similarity. However, the appropriate parameters should be chosen to achieve community division, furthermore, these existing algorithms based on the similarity of common neighbors have low discrimination between node pairs. To solve the above problems, a noval community detection algorithm using closeness similarity based on common neighbor node clustering entropy is proposed, shorted as CSCDA. Firstly, to improve detection accuracy, common neighbors and clustering coefficient are combined in the form of entropy, then a new closeness similarity measure is proposed. Through the designed similarity measure, the closeness similar node set of each node can be further accurately identified. Secondly, to reduce the randomness of the community detection result, based on the closeness similar node set, the node leadership is used to determine the most closeness similar first-order neighbor node for merging to create the initial communities. Thirdly, for the difficult problem of parameter selection in existing algorithms, the merging of two levels is used to iteratively detect the final communities with the idea of modularity optimization. Finally, experiments show that the normalized mutual information values are increased by an average of 8.06% and 5.94% on two scales of synthetic networks and real-world networks with real communities, and modularity is increased by an average of 0.80% on the real-world networks without real communities.

• Journal of Information Processing Systems
• /
• 제15권5호
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• 한국환경복원기술학회지
• /
• 제17권3호
• /
• pp.35-51
• /
• 2014

A phytosociological vegetation survey was conducted in July to September 2011 in order to examine the vegetation community structure in Mt. Ohseo area. It was aimed to provide basic data for the effective vegetation conservation by analyzing the importance, species diversity and community similarity of the forest community in Mt. Ohseo for each layer, followed by the classification of the actual forest vegetation. According to the cluster analysis, the community type of Mt. Ohseo was classified into a total of 4 vegetation communities: Pinus densiflora community, Cornus controversa-Quercus serrata community, Miscanthus sinensis community, and Quercus mongolica community; the vegetation type 4 showed the lowest species diversity index of 0.5236, and vegetation type-2 showed the highest species diversity index of 0.6606. The community similarity between Quercus mongolica community and Pinus densiflora community showed the highest 0.679, and the community similarity between Quercus serrata community and Pinus densiflora community and between Quercus serrata community and Quercus mongolica community showed the levels of 0.5, respectively.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권2호
• /
• pp.100-104
• /
• 2006

Fuzzy techniques can be applied in many domains of computer vision community. The definition of an adequate similarity measure for measuring the similarity between fuzzy sets is of great importance in the field of image processing, image retrieval and pattern recognition. This paper proposes a new class of the similarity measures. The properties, sensitivity and effectiveness of the proposed measures are investigated and tested on real data. Experimental results show that these similarity measures can provide a useful way for measuring the similarity between fuzzy sets.

• Journal of Information Processing Systems
• /
• 제19권1호
• /
• pp.55-66
• /
• 2023

Community portraits can deeply explore the characteristics of community structures and describe the personalized knowledge needs of community users, which is of great practical significance for improving community recommendation services, as well as the accuracy of resource push. The current community portraits generally have the problems of weak perception of interest characteristics and low degree of integration of topic information. To resolve this problem, the reader community portrait method based on the thematic and timeliness characteristics of interest labels (UIT) is proposed. First, community opinion leaders are identified based on multi-feature calculations, and then the topic features of their texts are identified based on the LDA topic model. On this basis, a semantic mapping including "reader community-opinion leader-text content" was established. Second, the readers' interest similarity of the labels was dynamically updated, and two kinds of tag parameters were integrated, namely, the intensity of interest labels and the stability of interest labels. Finally, the similarity distance between the opinion leader and the topic of interest was calculated to obtain the dynamic interest set of the opinion leaders. Experimental analysis was conducted on real data from the Douban reading community. The experimental results show that the UIT has the highest average F value (0.551) compared to the state-of-the-art approaches, which indicates that the UIT has better performance in the smooth time dimension.

• 지식경영연구
• /
• 제10권2호
• /
• pp.105-119
• /
• 2009

This study addresses the following questions : how does organization citizenship behavior(OCB) affect knowledge contribution in online communities? does the antecedents of OCB, cohesiveness and affection similarity, influence knowledge contribution in online communities? In order to test our hypotheses with an empirical study, we have conducted a survey which resulted in 192 valid response in the final sample. The PLS analysis results indicate that OCB affects knowledge contribution and coherence and affection similarity of online community users have influence on OCB. Further, knowledge contribution is influenced by community users' affection similarity. Practical implications of these findings and future research implications are also discussed.

• 생태와환경
• /
• 제54권4호
• /
• pp.291-302
• /
• 2021

본 연구는 영산강 하구에 위치한 세 호수들에서 식물플랑크톤 군집의 분포 양상 및 호소 간 군집 유사성을 확인하고 군집 구조의 차이에 영향을 미치는 요인들을 확인하고자 2014년 3월부터 2017년 11월까지 분기별 조사를 시행하였다. 조사 결과, 식물플랑크톤의 종 다양성은 영산호에서 가장 높았고, 평균 개체수는 금호호에서 가장 높았으며, 영암호는 다른 호수들에 비해 식물플랑크톤의 종수와 개체수가 낮은 것으로 확인되었다. NMDS 분석 결과, 영산호와 금호호의 식물플랑크톤 군집 분포는 뚜렷한 차이를 나타냈고, 세 호수의 식물플랑크톤 군집 분포에 영향을 미치는 요인은 수온, DO, T-N, NO₃-N, 전기전도도 등으로 확인되었다. Random Forest 분석을 통해 각 호수의 식물플랑크톤 군집에 영향을 미치는 요인을 확인한 결과, 세 호수 모두 공통적으로 NO₃-N의 영향력이 높았다. Indicator species analysis를 통해 확인된 각 호소별 지표종은 총 24종으로, 영산호에서 13종으로 가장 많았고, 영암호에서 2종으로 가장 적었으며, 호소별 지표종의 분류군이 구별되었다. SIMPER 분석 및 ANOSIM 결과, 영산호와 영암호의 식물플랑크톤 군집은 유사성을 나타내었고, 금호호의 경우 다른 호수와의 식물플랑크톤 군집이 다소 차이가 있는 것으로 확인되었다. 또한 각 호수의 지점별 식물플랑크톤 군집 유사성은 지점에 따라 차이가 있어 식물플랑크톤 군집 형성에 대해 연락수로의 영향력은 낮은 것으로 조사되었다.

• 한국환경과학회지
• /
• 제20권1호
• /
• pp.127-135
• /
• 2011

This study was carried out in each three study areas of Pinus densiflora community and Quercus mongolica community from March 5th, 2008 to October 15th, 2010 to analyze the relationship between seed bank and the actual vegetation of the lower layer. Based on the relationship between the lower layer of actual vegetation and the germination of seed bank, all of three study areas, the similarity of the actual vegetation of the lower layer and seed bank were high in Plot 1 (84.62%) and Plot 3 (89.91%). As for Quercus mongolica community, the similarity was high between the actual vegetation of the lower layer and seed bank in Plot 4 (82.24%) and Plot 6 (89.47%). Especially, the germination of the pine seed banks in the Pinus densiflora community compared to other tree species appeared in all. In Quercus mongolica community, Quercus mongolica did not appear among the seeds germinated in the seek bank, but the other tree species constituting the under layer of the community. In case of the restoration based on the actual vegetation, it is desirable to sue the lower layer of vegetation as the model for the making of its alternatives for restoration works of the species.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권4호
• /
• pp.432-436
• /
• 2010

소셜 네트워크를 비롯한 네트워크로부터 커뮤니티를 발견하려면 네트워크의 노드를 그룹 내에서는 서로 조밀하게 연결되고 그룹 간에는 연결의 밀도가 낮은 그룹들로 군집화하는 과정이 꼭 필요하다. 군집화 알고리즘의 성능을 위해서는 군집화의 기준이 되는 유사도 기준이 잘 정의되어야 한다. 이 논문에서는 네트워크 내의 커뮤니티 발견을 위해 유사도 기준을 정의하고, 정의한 유사도를 유사도 전파(affinity propagation) 알고리즘과 결합하여 만든 방법을 기존의 방법들과 비교한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2022년도 춘계학술발표대회
• /
• pp.366-369
• /
• 2022

The glut of information aggravated the process of data analysis and other procedures including data mining. Many algorithms were devised in Big Data and Data Mining to solve such an intricate problem. In this paper, we conducted research about the comparison of several similarity measures and community detection algorithms in collaborative filtering for movie recommendation systems. Movielense data set was used to do an empirical experiment. We applied three different similarity measures: Cosine, Euclidean, and Pearson. Moreover, betweenness and eigenvector centrality were used to detect communities from the network. As a result, we elucidated which algorithm is more suitable than its counterpart in terms of recommendation accuracy.