• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3935-3949
• /
• 2021

With the rapid development of Internet and big data technology, various online social network platforms have been established, producing massive information every day. Hot topic discovery aims to dig out meaningful content that users commonly concern about from the massive information on the Internet. Most of the existing hot topic discovery methods focus on a single network data source, and can hardly grasp hot spots as a whole, nor meet the challenges of text sparsity and topic hotness evaluation in cross-network scenarios. This paper proposes a novel hot topic discovery method across social network based on an im-proved LDA model, which first integrates the text information from multiple social network platforms into a unified data set, then obtains the potential topic distribution in the text through the improved LDA model. Finally, it adopts a heat evaluation method based on the word frequency of topic label words to take the latent topic with the highest heat value as a hot topic. This paper obtains data from the online social networks and constructs a cross-network topic discovery data set. The experimental results demonstrate the superiority of the proposed method compared to baseline methods.

• Journal of Internet Computing and Services
• /
• v.13 no.2
• /
• pp.73-86
• /
• 2012

This paper theoretically derives an algorithm to discover a new type of social networks from workflow models, which is termed workflow-based social network intelligence. In general, workflow intelligence (or business process intelligence) technology consists of four types of techniques that discover, analyze, monitor and control, and predict from workflow models and their execution histories. So, this paper proposes an algorithm, which is termed ICN-based workflow-based social network intelligence discovery algorithm, to be classified into the type of discovery techniques, which are able to discover workflow-based social network intelligence that are formed among workflow performers through a series of workflow models and their executions, In order particularly to prove the correctness and feasibility of the proposed algorithm, this paper tries to apply the algorithm to a specific workflow model and to show that it is able to generate its corresponding workflow-based social network intelligence.

• 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.

• Journal of Information Technology Services
• /
• v.16 no.3
• /
• pp.167-183
• /
• 2017

The rapid growth of information technology and mobile service platforms, i.e., internet, google, and facebook, etc. has led the abundance of data. Due to this environment, the world is now facing a revolution in the process that data is searched, collected, stored, and shared. Abundance of data gives us several opportunities to knowledge discovery and data mining techniques. In recent years, data mining methods as a solution to discovery and extraction of available knowledge in database has been more popular in e-commerce service fields such as, in particular, movie recommendation. However, most of the classification approaches for predicting the movie popularity have used only several types of information of the movie such as actor, director, rating score, language and countries etc. In this study, we propose a classification-based support vector machine (SVM) model for predicting the movie popularity based on movie's genre data and social network data. Social network analysis (SNA) is used for improving the classification accuracy. This study builds the movies' network (one mode network) based on initial data which is a two mode network as user-to-movie network. For the proposed method we computed degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality as centrality measures in movie's network. Those four centrality values and movies' genre data were used to classify the movie popularity in this study. The logistic regression, neural network, $na{\ddot{i}}ve$ Bayes classifier, and decision tree as benchmarking models for movie popularity classification were also used for comparison with the performance of our proposed model. To assess the classifier's performance accuracy this study used MovieLens data as an open database. Our empirical results indicate that our proposed model with movie's genre and centrality data has by approximately 0% higher accuracy than other classification models with only movie's genre data. The implications of our results show that our proposed model can be used for improving movie popularity classification accuracy.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.110-117
• /
• 2015

In mobile social network, it is a critical challenge to select an optimal set of devices to supply high quality service constantly under dynamic network topology and the limit of device capacity in mobile ad-hoc network (MANET). In this paper, a multi-devices composition and maintenance problem is proposed with ubiquitous service model and network model. In addition, a multi-devices composition and maintenance approach with dynamic planning is proposed to deal with this problem, consisting of service discovery, service composition, service monitor and service recover. At last, the simulation is implemented with OPNET and MATLAB and the result shows this mechanism is better applied to support complex ubiquitous service.

• Journal of Service Research and Studies
• /
• v.2 no.1
• /
• pp.13-27
• /
• 2012

Companies see a new business opportunity in the increased popularity of social network services and the related studies are also gaining more attention. This study attempted to analyze the social networks and thereby find a pattern in the use of social network services. Network users' pattern has been categorized by their purpose of use. Among various social network services, we selected the Facebook and its users were analyzed by a network analysis tool called NodeXL. In the end, several subgroups have been identified in a seemingly homogeneous network. Furthermore, the network shape differences according to the usage of social network services has been studied by comparing "friends" of an individual Facebook user with those of the K University Facebook page.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of Information Technology Applications and Management
• /
• v.25 no.4
• /
• pp.185-196
• /
• 2018

This study investigates the social network among authors to improve the quality of Panel researches. Korea Health Panel (KHP), implemented by the collaborative work between KIHASA (Korea Institute for Health and Social Affairs) and NHIC (National Health Insurance Service) since 2008, provides a critical infrastructure for policy making and management for insurance system and healthcare service. Using bibliographic data extracted from academic databases, eighty articles were extracted in domestic and international journals from 2008 to 2014, April. Data were analyzed by NetMiner 4.0, social network analysis software, to identify the extent to which authors are involved in healthcare use research and the patterns of collaboration between them. Analysis reveals that most authors publish a very small number of articles and collaborate within tightly knit circles. Centrality measures confirm these findings by revealing that only a small percentage of the authors are structurally dominant, and influence the flow of communication among others. It leads to the discovery of dependencies between the elements of the co-author network such as affiliates in health panel communities. Based on these findings, we recommend that Korea Health Panel could benefit from cultivating a wider base of influential authors and promoting broader collaborations.

• Journal of Internet Computing and Services
• /
• v.20 no.2
• /
• pp.101-108
• /
• 2019

Workflow management systems (WfMSs) automate and manage workflows, which are implementations of organizational processes operated in process-centric organizations. In this paper, wepropose an algorithm to discover temporal work transference networks from workflow execution logs. The temporal work transference network is a special type of enterprise social networks that consists of workflow performers, and relationships among them that are formed by work transferences between performers who are responsible in performing precedent and succeeding activities in a workflow process. In terms of analysis, the temporal work transference network is an analytical property that has significant value to be analyzed to discover organizational knowledge for human resource management and related decision-making steps for process-centric organizations. Also, the beginning point of implementinga human-centered workflow intelligence framework dealing with work transference networks is to develop an algorithm for discovering temporal work transference cases on workflow execution logs. To this end, we first formalize a concept of temporal work transference network, and next, we present a discovery algorithm which is for the construction of temporal work transference network from workflow execution logs. Then, as a verification of the proposed algorithm, we apply the algorithm to an XES-formatted log dataset that was released by the process mining research group and finally summarize the discovery result.

• International Journal of Internet, Broadcasting and Communication
• /
• v.6 no.1
• /
• pp.5-8
• /
• 2014

Social networking services that connect a person to other people are attracting our attention and various types of on-the-network services are provided. Library has been playing a role of social media by providing with materials such as books and magazines, and with a place for reading, studying, getting lectures, etc. In this paper, we present a method for finding candidates of groups of the library's patrons who share interest areas by utilizing the loan records, which are obtainable by every library. Such a homogeneous group can become a candidate for a study group, a community for exchange ideas, and other activity group. We apply the method to a collection of loan records of a university library, find some problem to be solved, and propose measures for more detailed solutions. Even though the potential group finding problem still remains a lot of problems to be solved, its potential importance is very high and thus to be studies even more for future applications.