• Journal of Software Engineering Society
• /
• v.25 no.4
• /
• pp.69-74
• /
• 2012

This article suggests applicability to community detection algorithm from module recovering process of software architecture through compare to software clustering metric and community dectection metric. in addition to, analyze mutual relation and difference between separated module and measurement value of typical clustering algorithms and community detection algorithms. and then only sugeested several kinds basis that community detection algorithm can use to recovering module view of software architecture and, by so comparing measurement value of existing clustering metric and community algorithms, this article suggested correlation of two result data.

• Korean Journal of Community Nutrition
• /
• v.6 no.1
• /
• pp.97-107
• /
• 2001

The clustering of insulin resistance with hypertension, glucose intolerance, hyperinsulinemia, increased triglyceride and decreased HDL cholesterol levels, and central and overall obesity has been called syndrome X, or the insulin resistance syndrome(IRS). To develop a nutrition service for IRS, this study was performed to evaluate the prevalence of each component of the metabolic abnormalities of IRS and analyze the clustering pattern of IRS among subjects living in the Taegu community. Participants in this study were 9234(mean age ; M/F 48/40yrs);63.5% were men, 24.4% were obese, 13.3% had hypertension. 3.7% had hyperglycemia, and 32.4% had hyperlipidemia. The IRS was defined as the coexistence of two or more components among metabolic abnormalities; obesity, hypertension. hyperglucemia and hyperlipidemia. The prevalence of IRS in Taegu was 19.2%(M/F:20.8%/16.4%), the clustering of these fisk variables was higher in advanced age group. Among the subjects of IRS having two of more diseases, 75.6% were obese, the pattern were similar in men and women. The younger, the higher the prevalence of obesity associated clustering patterns. The prevalence of obesity associated patterns among the hyperglycemia associated clustering patterns was 44.5%. The samples of the representative clustering patterns were obesity and hyperlipidemia (8.0%), hypertension and hyperlipidemia(3.2%), hypertension, obesity and hyperlipiemia(3.1%), hypertension and obesity(2.3%), and hyperglycemia and hyperlipidemia(0.8%). The clustering of obesity and hyperlipidemia until 50 year old groups, and the clustering of hypertension and hyperlipidemia in the 60 and 70 age groups were the most prevalent. We concluded that insulin resistance syndrome was a relatively common disorder in the Taegu community, and prevalence and the characteristics of the intervention strategies for IRS are desired, an effective improvement will be achieved.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.163-177
• /
• 2021

Many methods of discovering social networking communities or clustering of features are based on the network structure or the content network. This paper proposes a community discovery method based on topic models using a time factor and an unsupervised clustering method. Online community discovery enables organizations and businesses to thoroughly understand the trend in users' interests in their products and services. In addition, an insight into customer experience on social networks is a tremendous competitive advantage in this era of ecommerce and Internet development. The objective of this work is to find clusters (communities) such that each cluster's nodes contain topics and individuals having similarities in the attribute space. In terms of social media analytics, the method seeks communities whose members have similar features. The method is experimented with and evaluated using a Vietnamese corpus of comments and messages collected on social networks and ecommerce sites in various sectors from 2016 to 2019. The experimental results demonstrate the effectiveness of the proposed method over other methods.

• International Journal of Computer Science & Network Security
• /
• v.24 no.8
• /
• pp.61-71
• /
• 2024

The dynamic nature of Online Social Networks (OSNs), especially on platforms like Twitter, presents challenges in identifying and responding to community attacks, particularly within Arabic content. The proposed integrated system addresses these challenges by achieving 91% accuracy in detecting real-time community event attacks while efficiently managing computational costs. This is accomplished through the use of specialized integrated approach clustering to detect both major and minor attacks. Additionally, the system leverages clustering algorithms, temporal modules, and social network graphs to identify events, map communities, and analyze online dynamics. An extensive parameter sensitivity analysis was conducted to fine-tune the algorithm, and the system's effectiveness was validated using a benchmark dataset, demonstrating substantial improvements in event detection.

• Journal of the Korean housing association
• /
• v.19 no.6
• /
• pp.85-93
• /
• 2008

This study analyzes areas, traffic lines and characteristics of block of traditional villages in order to suggest how to build urban village in the way that can solve problems occurring in residential areas these days. The study showed the following results: 1) Traditional villages have definite boundary and entrance, and the community area for the villages is close to the entrance to encourage community activities of villagers. 2) With an access in the form of a blind alley branched from the main road, traditional villages form a small-sized clustering and encourage community activities in a natural way. 3) Formed of block with a pattern of net, blind alley or standing in a line on both sides, traditional villages help residents to form close relations between. These findings suggest that for building desirable urban villages, 1) they should have definite boundary, 2) size and location of community area should be determined in the way to activate community activities of residents, 3) roads inside the village should have branched form rather than standardized check pattern so that small-sized clustering could be formed along the branched inner roads, and 4) clustering in villages should be arranged in a line on both sides or in the form of a blind alley giving consideration to the length and width of roads. The roads should be also of a closed type so that residents could create strong bonds with their neighbors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.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 Korean Society of Industrial and Systems Engineering
• /
• v.26 no.1
• /
• pp.17-21
• /
• 2003

We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorithms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper, we introduce new similarity measure and develop a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.125-132
• /
• 2002

We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorlthms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper we introduce new similarity measure and develope a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.69-75
• /
• 2011

A clustering process for nodes in a network is required to find communities from social networks. General clustering algorithm needs to be configured the number of communities in advance. The number of communities is a very important element because the result of clustering can be different, depending on it. In this paper, we define the external community relationship which is distinguished between communities. Using the external community relationship as an evaluation metric of clustering result, we propose a method to determine the number of communities dynamically. We compare the proposed method to existing methods based on the accuracy of the number of communities and the average purity of communities. Our results show favorable performance for these criteria compared to the existing methods that were evaluated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.23-36
• /
• 1997

In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.