• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of Korea Port Economic Association
• /
• v.34 no.4
• /
• pp.17-38
• /
• 2018

The purpose of this study is to establish shipping companies' selection factors related to a classification society and to explore the relative importance of each factor using the analytical hierarchy process(AHP) technique. Insufficient research exists on the hierarchial structure of shipping companies' factors of selecting a classification society. The factors are identified and classified into two tiers of major and detailed factors, by referring to the related industrial linkages, prior research related to the determinants, and the process and service delivery of the classification society's activities. The empirical analysis of this study is based on the relative importance of determinants when selecting a classification society, and experts engaged with shipping companies were surveyed using questionnaires. The results of the AHP methodology on the main factors of shipping companies in selecting a classification society are as follows. The relative importance of the main factors was 0.373 for technical and survey services, 0.284 for recognized organizations(RO) functions, 0.177 for cost and 0.167 for market(related industry) expectations. The relative importance of the detailed factors is 0.144 for the ability to respond to a port state control(PSC) inspection, 0.143 for technical services, 0.090 for the requirements of financial institutions/ shippers/shipyards, 0.087 for class maintenance costs, 0.086 for the survey network, 0.085 for surveyor competency, 0.072 for cooperation with IMO and government authorities, 0.067 for recognition for RO, 0.058 for the business power of the classification society, 0.052 for the initial inspection costs, 0.040 for reputation and trustworthiness, 0.038 for the costs related to the class, and 0.037 for connections to related industries.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.1 no.1
• /
• pp.52-57
• /
• 2002

A simulation tool for an optimal ATIS design and drivers' dynamic route choice behavior analysis is developed, which is applicable to urban networks. Due to the difficulty to make drivers feel the time pressure according to traffic conditions, current SP questionnaire survey type surveys have a limitation to capture correct driver reactions to real-time traffic Information provision. The simulator Is a web-based upgraded version, named WATiSim (Web-based ATIS Simulator), to quickly perform a wide population survey with a minimal cost using INTERNET Furthermore, the time pressure issue is lessened by its interface and simulation modules. After WATiSim mimicked a VMS based ATIS in a partial network of Seoul Metropolitan, reactions of drivers to various traffic conditions were surveyed through INTERNET and analyzed using a logit model. Drivers under the ATIS environment clearly understood the provided traffic information, and their reactions were closely related to traffic conditions, scheduled delay, trip purposes as well as toll charge if any.

• The Journal of Society for e-Business Studies
• /
• v.17 no.2
• /
• pp.129-147
• /
• 2012

Collaborative filtering (CF), one of the most successful recommendation techniques, has been used in a number of different applications such as recommending web pages, movies, music, articles and products. One of the critical issues in CF is why recommendation performances are different depending on application domains. However, prior literatures have focused on only data characteristics to explain the origin of the difference. Scant attentions have been paid to provide systematic explanation on the issue. To fill this research gap, this study attempts to systematically explain why recommendation performances are different using structural indexes of social network. For this purpose, we developed hypotheses regarding the relationships between structural indexes of social network and recommendation performance of collaboration filtering, and empirically tested them. Results of this study showed that density and inconclusiveness positively affected recommendation performance while clustering coefficient negatively affected it. This study can be used as stepping stone for understanding collaborative filtering recommendation performance. Furthermore, it might be helpful for managers to decide whether they adopt recommendation systems.

• The Journal of Bigdata
• /
• v.4 no.2
• /
• pp.159-173
• /
• 2019

Last-Mile delivery optimization plays a key role in the urban supply chain operation, which is the most expensive and time-consuming and most complicated part of the whole delivery process. The urban consolidation center (UCC) is regarded as a significant asset for supporting customer demand in the last-mile delivery service. It is the key benefit of UCC to improve the load balance of vehicles and to reduce the total traveling distance by finding the better route with the well-organized multi-leg vehicle journey in the urban area. This paper presents the model using multiple scenario analysis integrated with mathematical optimization techniques using Geographic Information System (GIS). The model aims to find the best solution for the distribution network consisted of DC and UCC, which is applied to the case of Ulaanbaatar Mongolia. The proposed methodology integrates two sub-models, location-allocation model and vehicle routing problem. The multiple scenarios devised by selecting locations of UCC are compared considering the general performance and delivery patterns together. It has been adopted to make better decisions the quantitative metrics such as the economic value of capital cost, operating cost, and balance of using available resources. The result of this research may help the manager or public authorities who should design the distribution network for the last mile delivery service optimization using UCC within the urban area.

• Journal of Internet Computing and Services
• /
• v.17 no.3
• /
• pp.107-113
• /
• 2016

Following the recent advancement in the use of social networks, a vast amount of different online reviews is created. These variable online reviews which provide feedback data of contents' are being used as sources of valuable information to both contents' users and providers. With the increasing importance of online reviews, studies on opinion mining which analyzes online reviews to extract opinions or evaluations, attitudes and emotions of the writer have been on the increase. However, previous sentiment analysis techniques of opinion-mining focus only on the classification of reviews into positive or negative classes but does not include detailed information analysis of the user's satisfaction or sentiment grounds. Also, previous designs of the sentiment analysis technique only applied to one content domain that is, either product or movie, and could not be applied to other contents from a different domain. This paper suggests a sentiment analysis technique that can analyze detailed satisfaction of online reviews and extract detailed information of the satisfaction level. The proposed technique can analyze not only one domain of contents but also a variety of contents that are not from the same domain. In addition, we design a system based on Hadoop to process vast amounts of data quickly and efficiently. Through our proposed system, both users and contents' providers will be able to receive feedback information more clearly and in detail. Consequently, potential users who will use the content can make effective decisions and contents' providers can quickly apply the users' responses when developing marketing strategy as opposed to the old methods of using surveys. Moreover, the system is expected to be used practically in various fields that require user comments.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.4
• /
• pp.107-117
• /
• 2011

Smartphones are widely used as a mobile communication devices with more advanced computing ability and connectivity than a contemporary feature phone. As the market expands, many brand-new smartphones are released and chosen by (potential) smartphone users. In spite of smartphone's popularity, little research of the factors affecting the evaluation of smartphones and their influences on smartphone choice have been performed. Therefore, we aim to analyze evaluation factors of smartphone selection and use in this research. We use Fuzzy Analytic Hierarchy Process method, a Multi-Criteria Decision Making (MCDM) model, to find the relative importance among the factors considering the fuzziness of pair-wise comparison using AHP. After reviewing related works and interviewing the focus group, we extract the five independent factors influencing the choice and use of a smartphone. Pair-wise comparison and triangle fuzzy numbers are used to calculate the relative importance of factors. We analyze not only the whole interviewees' responses, but the differences between smartphone users and non-users. Practical implications are delivered in concluding remarks.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1647-1656
• /
• 2007

With the growing international consensus regarding sustainable development of transportation, the plan of transportation infrastructure needs to meet various requirements toward enhancing environmental conditions. Accordingly, the upcoming long-term plan of high-speed rail network has to be reflecting the sustainability of transportation systems. In this paper, we propose methodologies based on multi-attribute utility theory for determining priorities of sustainable high-speed rail investment. The proposed methodologies identify indicators for sustainable transportation systems such as economic, environmental, social, and transportation-related ones and then, explain the way how to evaluate the overall sustainability by comparing the relative importance among indicators. This will help transportation agencies to prioritize high-speed rail investment toward sustainable transportation systems.

• Journal of Intelligence and Information Systems
• /
• v.17 no.1
• /
• pp.153-169
• /
• 2011

Today using Internet environment is considered absolutely essential for establishing corporate marketing strategy. Companies have promoted their products and services through various ways of on-line marketing activities such as providing gifts and points to customers in exchange for participating in events, which is based on customers' membership data. Since companies can use these membership data to enhance their marketing efforts through various data analysis, appropriate website membership management may play an important role in increasing the effectiveness of on-line marketing campaign. Despite the growing interests in proper membership management, however, there have been difficulties in identifying inappropriate members who can weaken on-line marketing effectiveness. In on-line environment, customers tend to not reveal themselves clearly compared to off-line market. Customers who have malicious intent are able to create duplicate IDs by using others' names illegally or faking login information during joining membership. Since the duplicate members are likely to intercept gifts and points that should be sent to appropriate customers who deserve them, this can result in ineffective marketing efforts. Considering that the number of website members and its related marketing costs are significantly increasing, it is necessary for companies to find efficient ways to screen and exclude unfavorable troublemakers who are duplicate members. With this motivation, this study proposes an approach for managing duplicate membership based on the social network analysis and verifies its effectiveness using membership data gathered from real websites. A social network is a social structure made up of actors called nodes, which are tied by one or more specific types of interdependency. Social networks represent the relationship between the nodes and show the direction and strength of the relationship. Various analytical techniques have been proposed based on the social relationships, such as centrality analysis, structural holes analysis, structural equivalents analysis, and so on. Component analysis, one of the social network analysis techniques, deals with the sub-networks that form meaningful information in the group connection. We propose a method for managing duplicate memberships using component analysis. The procedure is as follows. First step is to identify membership attributes that will be used for analyzing relationship patterns among memberships. Membership attributes include ID, telephone number, address, posting time, IP address, and so on. Second step is to compose social matrices based on the identified membership attributes and aggregate the values of each social matrix into a combined social matrix. The combined social matrix represents how strong pairs of nodes are connected together. When a pair of nodes is strongly connected, we expect that those nodes are likely to be duplicate memberships. The combined social matrix is transformed into a binary matrix with '0' or '1' of cell values using a relationship criterion that determines whether the membership is duplicate or not. Third step is to conduct a component analysis for the combined social matrix in order to identify component nodes and isolated nodes. Fourth, identify the number of real memberships and calculate the reliability of website membership based on the component analysis results. The proposed procedure was applied to three real websites operated by a pharmaceutical company. The empirical results showed that the proposed method was superior to the traditional database approach using simple address comparison. In conclusion, this study is expected to shed some light on how social network analysis can enhance a reliable on-line marketing performance by efficiently and effectively identifying duplicate memberships of websites.

• Journal of Intelligence and Information Systems
• /
• v.27 no.1
• /
• pp.23-46
• /
• 2021

Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.