• Information Systems Review
• /
• v.20 no.1
• /
• pp.1-16
• /
• 2018

The development and generalization of the Internet increased the popularity of food delivery service applications in Korea. The food delivery market based on online-to-offline service is growing rapidly. This study compares the usability of Korean food delivery service application between that of Chinese food delivery service application. This study suggests improvement points for Korean food delivery service applications. To conduct this study, we explore the status of various food delivery service applications and conduct interviews and surveys based on the honeycomb model developed by Peter Morville. This study obtained the following results. First, all restaurants participating in the Korean food delivery service must be able to accept order through the application. Second, the shopping cart function must be able to accept order of all restaurants simultaneously. Third, when users look for menu recommendation, their purchase history and shopping cart functions should appear at the first page of the website. Users should be able to perceive the improved usability of the website using those functions. Fourth, when the search window is fixed on the top of each page, users should be able to find the information they need. Fifth, the application must allow users to find the exact location of the delivery person and the estimated delivery time. Finally, the restaurants'address should be disclosed and fast delivery time should be confirmed to enhance users'trust on the application. This study contributes to academia and industry by suggesting useful insight into food delivery service applications and improving the point of food delivery service application in Korea.

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

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

The core service of most research portal sites is providing relevant research papers to various researchers that match their research interests. This kind of service may only be effective and easy to use when a user can provide correct and concrete information about a paper such as the title, authors, and keywords. However, unfortunately, most users of this service are not acquainted with concrete bibliographic information. It implies that most users inevitably experience repeated trial and error attempts of keyword-based search. Especially, retrieving a relevant research paper is more difficult when a user is novice in the research domain and does not know appropriate keywords. In this case, a user should perform iterative searches as follows : i) perform an initial search with an arbitrary keyword, ii) acquire related keywords from the retrieved papers, and iii) perform another search again with the acquired keywords. This usage pattern implies that the level of service quality and user satisfaction of a portal site are strongly affected by the level of keyword management and searching mechanism. To overcome this kind of inefficiency, some leading research portal sites adopt the association rule mining-based keyword recommendation service that is similar to the product recommendation of online shopping malls. However, keyword recommendation only based on association analysis has limitation that it can show only a simple and direct relationship between two keywords. In other words, the association analysis itself is unable to present the complex relationships among many keywords in some adjacent research areas. To overcome this limitation, we propose the hybrid approach for establishing association network among keywords used in research papers. The keyword association network can be established by the following phases : i) a set of keywords specified in a certain paper are regarded as co-purchased items, ii) perform association analysis for the keywords and extract frequent patterns of keywords that satisfy predefined thresholds of confidence, support, and lift, and iii) schematize the frequent keyword patterns as a network to show the core keywords of each research area and connecting keywords among two or more research areas. To estimate the practical application of our approach, we performed a simple experiment with 600 keywords. The keywords are extracted from 131 research papers published in five prominent Korean journals in 2009. In the experiment, we used the SAS Enterprise Miner for association analysis and the R software for social network analysis. As the final outcome, we presented a network diagram and a cluster dendrogram for the keyword association network. We summarized the results in Section 4 of this paper. The main contribution of our proposed approach can be found in the following aspects : i) the keyword network can provide an initial roadmap of a research area to researchers who are novice in the domain, ii) a researcher can grasp the distribution of many keywords neighboring to a certain keyword, and iii) researchers can get some idea for converging different research areas by observing connecting keywords in the keyword association network. Further studies should include the following. First, the current version of our approach does not implement a standard meta-dictionary. For practical use, homonyms, synonyms, and multilingual problems should be resolved with a standard meta-dictionary. Additionally, more clear guidelines for clustering research areas and defining core and connecting keywords should be provided. Finally, intensive experiments not only on Korean research papers but also on international papers should be performed in further studies.

• Journal of Information Technology Applications and Management
• /
• v.26 no.4
• /
• pp.51-69
• /
• 2019

One of the most considerate phenomena of the era of the Fourth Industrial Revolution is the use of digital devices. Digitalization is rapidly advancing through all areas of industry and life. Customer journey with digitalization is looking totally different from previous customer journey. The research targets were users of fashion, automobiles, cosmetics and online shopping malls. We analyzed 300 people for each valid questionnaire. The results of the study are as follows. First, it has been proven that digital experience affects positive (+) impact on purchasing intention and positive (+) impact on recommending intention and negative impact (-) on switching intent and subsequently affects positive impact (+) to purchase and incase of switching intent, negative impact (-) to purchase. Unlike traditional methods such as SPC(Service Profit Chain), the Digital experience to Purchase process Chain (DPC) has been identified to be suitable in the digital age. Second, the digital satisfied group (5 score-very satisfaction) has shown same result as above. However the digital neutral group (even though 4 score- satisfaction in five-point scale), specially in a highly competitive industry, has different from the satisfied group and 3 score-normal is same as dissatisfied group. It means that this group is that If there is a high level of attractiveness of substitute goods, there is a high possibility of switching them. It has supported Jones and Sasser [1995] that there have been two types of loyalty of true long-term loyalty and what we call false loyalty in the highly competitive industry zone which is commoditization or low differentiation, many substitutes, low cost of switching. Identifying true loyalty and false loyalty is crucial to establishing a customer experience strategy. it is necessary to actively utilize long-term digital experiences strategy to increase the total satisfaction of digital experience through all of customer purchasing journey in order to enhance the digital customer experience. It is difficult to see the effect as a one-time event. It should be scaled over the entire customer purchase process over a long period of time, which can positively affect purchase intention, recommendation intention, and conversion intention. This is also why it is difficult for second-runners to overtake first-runners in a short period.

• Journal of Internet Computing and Services
• /
• v.23 no.4
• /
• pp.21-33
• /
• 2022

Recently, the recommender system has been widely used in various fields such as movies, music, online shopping, and social media, and in the meantime, the recommender model has been developed from correlation analysis through the Apriori model, which can be said to be the first-generation model in the recommender system field. In 2005, many models have been proposed, including deep learning-based models, which are receiving a lot of attention within the recommender model. The recommender model can be classified into a collaborative filtering method, a content-based method, and a hybrid method that uses these two methods integrally. However, these basic methods are gradually losing their status as methodologies in the field as they fail to adapt to internal and external changing factors such as the rapidly changing user-item interaction and the development of big data. On the other hand, the importance of deep learning methodologies in recommender systems is increasing because of its advantages such as nonlinear transformation, representation learning, sequence modeling, and flexibility. In this paper, among deep learning methodologies, RNN, CNN, and GAN-based models suitable for sequential modeling that can accurately and flexibly analyze user-item interactions are classified, compared, and analyzed.