In-Jeong Chung

A real time process management system using RFID data mining

Abstract Recently, there have been numerous efforts to fuse the latest Radio Frequency Identification (RFID) technology with the Enterprise Information System (EIS). However, in most cases these attempts are centered mainly on the simultaneous multiple reading capability of RFID technology, and thus neglect the management of massive data generated from the RFID reader. As a result, it is difficult to obtain flow information for RFID data mining related to real time process control. In this paper, we propose an advanced process management method, called ‘Procedure Tree’ (PT), for RFID data mining. Using the suggested PT, we are able to manage massive RFID data effectively, and perform real time process management efficiently. Then we evaluate the efficiency of the proposed method, after applying it to a real time process control system connected to the RFID-based EIS. For the verification of the suggested system, we collect an enormous amount of data in the Enterprise Resource Planning (ERP) database, analyze characteristics of the collected data, and then compute the elapsed time on each stage in process control. The suggested system was able to perform what the traditional RFID-based process control systems failed to do, such as predicting and tracking of real time process and inventory control.

Automatic generation of service ontology from UML diagrams for semantic web services

We present in this paper the methodology for automatic generation of OWL-S service model ontology along with results and issues First we extract information related to atomic services and their properties such as IOPE from UML class diagram, and retrieve information related to composition of services from UML state-chart diagram Then XSLT applications utilize the acquired information to generate the OWL-S service model ontology through the predefined mappings between OWL-S constructs for composite services and UML state-chart primitives For the justification of generated service ontology several validation checks are performed Our service ontology generation method is fully automatic and effective in that it is performed in familiar environment to developers and information needed to generate service ontology is provided necessarily during service development It is also noticeable to facilitate representing the condition with GUI rather than complex language like OCL.

Contents Recommendation Method Using Social Network Analysis

With the recent tremendous increase in the volume of Web 3.0 content, content recommendation systems (CRS) have emerged as an important aspect of social network services and computing. Thus, several studies have been conducted to investigate content recommendation methods (CRM) for CRSs. However, traditional CRMs are limited in that they cannot be used in the Web 3.0 environment. In this paper, we propose a novel way to recommend high-quality web content using degree of centrality and term frequency–inverse document frequency (TF–IDF). In the proposed method, we analyze the TF–IDF and degree of centrality of collected RDF site summary and friend-of-a-friend data and then generate content recommendations based on these two analyzed values. Results from the implementation of the proposed system indicate that it provides more appropriate and reliable contents than traditional CRSs. The proposed system also reflects the importance of the role of content creators.

ASVMRT: Materialized View Selection Algorithm in Data Warehouse

In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view selection algorithms, all relations are considered for selection as materialized views. However, materializing all relations rather than a part results in much worse performance in terms of time and space costs. Therefore, we present an improved algorithm for selection of views to materialize using the clustering method to overcome the problem resulting from conventional view selection algorithms. In the presented algorithm, ASVMRT (Algorithm for Selection of Views to Materialize using Reduced Table), we first generate reduced tables in the data warehouse using clustering based on attribute-values density, and then we consider the combination of reduced tables as materialized views instead of a combination of the original base relations. For the justification of the proposed algorithm, we reveal the experimental results in which both time and space costs are approximately 1.8 times better than conventional algorithms.

Improved View Selection Algorithm in Data Warehouse

In order to minimize the query processing time, a data warehouse maintains materialized views of aggregate data derived from a fact table. However, due to the expensive computing and space costs materializing the whole relations instead of part of the relations results in much worse performance. Consequently, proper selection of appropriate views to be materialized is very important to get a precise and fast response in the data warehouse. However, this view selection problem is NP-hard problem, and there have been many research works on the selection of materialized views. In this paper we propose an improved algorithm to overcome problems of existing view selection algorithms. In the presented algorithm, we first construct the reduced tables in the data warehouse using clustering method among data mining techniques, and then we consider the combination of reduced tables as the materialized views instead of combination of the original base relations. For the justification of the suggested idea, we show the experimental results in which time as well as space costs are about 1.7 times better than the conventional approaches which considered all the tuples in a relation to materialize.

An Improved Social Network Analysis Method for Social Networks

Recently, Social Network Service (SNS) users are rapidly increasing, and Social Network Analysis (SNA) methods are used to analyze the structure of user relationship or messages in many fields. However, the SNA methods based on the shortest distance among nodes is time-consuming in measuring computation time. In order to solve this problem, we present a heuristic method for the shortest path search using SNS user graphs. Our proposed method consists of three steps. First, it sets a start node and a goal node in the Social Network (SN), which is represented by trees. Second, the goal node sets a temporary node starting from a skewed tree, if there is a goal node on a leaf node of the skewed tree. Finally, the betweenness and closeness centralities are computed with the heuristic shortest path search. For verification of the proposed method, we demonstrate an experimental analysis of betweenness centrality and closeness centrality, with 164,910 real data in an SNS. In the experimental results, the method shows that the computation time of betweenness centrality and closeness centrality is faster than the traditional method. This heuristic method can be used to analyze social phenomena and trends in many fields.

Community Topical “Fingerprint” Analysis Based on Social Semantic Networks

Community analysis of social networks is a widely used technique in many fields. There have been many studies on community detection where the detected communities are attached to a single topic. However, an overall topical analysis for a community is required since community members are often concerned with multiple topics. In this paper, we propose a semantic method to analyze the topical community “fingerprint” in a social network. We represent the social network data as an ontology, and integrate with two other ontologies, creating a Social Semantic Network (SSN) context. Then, we take advantage of previous topological algorithms to detect the communities and retrieve the topical “fingerprint” using SPARQL. We extract about 210,000 Twitter profiles, detect the communities, and demonstrate the topical “fingerprint”. It shows human-friendly as well as machine-readable results, which can benefit us when retrieving and analyzing communities according to their interest degrees in various domains.

Content Recommendation Method Using FOAF and SNA

With the rapid growth of user-created contents and wide use of community-based websites, content recommendation systems have attracted the attention of users. However, most recommendation systems have limitations in properly reflecting each user’s characteristics, and difficulty in recommending appropriate contents to users. Therefore, we propose a content recommendation method using Friend-Of-A-Friend (FOAF) and Social Network Analysis (SNA). First, we extract user tags and characteristics using FOAF, and generate graphs with the collected data, with the method. Next, we extract common characteristics from the contents, and hot tags using SNA, and recommend the appropriate contents for users. For verification of the method, we analyzed an experimental social network with the method. From the experiments, we verified that the more users that are added into the social network, the higher the quality of recommendation increases, with comparison to an item-based method. Additionally, we can provide users with more relevant recommendation of contents.

An Improved Method for Measurement of Gross National Happiness Using Social Network Services

Studies on the measurement of happiness have been utilized in a variety of areas; in particular, it has played an important role in the measurement of society stability. As the number of users of Social Network Services (SNSs) increase, efforts are being made to measure human well-being by analyzing user messages in SNSs. Most previous works mainly counted positive and negative words; they did not consider the grammar and emotion. In this paper, we reorganize the mechanism to harness the advantages of (a) Part-Of-Speech (POS) tagging for grammatical analysis, and (b) the SentiWordNet lexicon for the assignment of sentiment scores for emotion degree. We suggest a modified formula for calculating the Gross National Happiness (GNH). To verify the method, we gather a real-world dataset from 405,700 Twitter users, measure the GNH, and compare it with the Gallup well-being release. We demonstrate that the method has more precise computation ability for GNH.

Sentiment trend analysis in social web environments

In this paper, we propose a novel method for sentiment trend analysis using Ant Colony Optimization (ACO) algorithm and SentiWordNet. We first collect social data in the form of Resource Description Framework (RDF) triples, and then use ACO algorithm to digitize the amassed RDF triples. Using ACO algorithm, we then compute pheromone values to extract the trends of the users sentiments with the modified equations. Next, we compute the users sentiment scores for the computed pheromone values with respect to the sentiment words with SentiWordNet. Finally, we analyze the sentiment trend of the online user by time. For verification of the proposed method, we conduct experiments, and compare the analyzed sentiment trends with their real daily lives. The results show that the proposed method performs satisfactory sentiment trend analysis on real data.