• Title/Summary/Keyword: Recommendation Technique

Search Result 224, Processing Time 0.025 seconds

Design of Recommendation Technique using Social Information (소셜 정보를 이용한 추천 기법의 설계)

  • Han, Xiaoyue;Lee, Min-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.84-86
    • /
    • 2012
  • 최근 유무선 인터넷 인프라의 보급과 스마트폰의 등장으로 인터넷 사용이 급속히 늘어나면서 많은 사람들이 커뮤니티, 블로그, 트위터, 등 기타 다양한 온라인 사이트를 통하여 자신의 견해나 의견을 공개적으로 표현하고 있다. 스마트폰과 SNS 환경이 보편화됨에 따라 사람들은 점점 더 자신들의 취향에 맞는 정보의 교환을 원하고 있으며 단순한 정보검색보다는 다른 사람들의 직접적인 경험이나 의견을 반영하는 정보추천에 대한 비중이 커지고 있는 추세이다. 본 논문에서는 이런 소셜 네트워크에 널려있는 데이터들을 이용한 추천시스템 기법을 제안한다.

Performance analysis of WPM-based transmission with equalization-aware bit loading

  • Buddhacharya, Sarbagya;Saengudomlert, Poompat
    • ETRI Journal
    • /
    • v.41 no.2
    • /
    • pp.184-196
    • /
    • 2019
  • Wavelet packet modulation (WPM) is a multicarrier modulation (MCM) technique that has emerged as a potential alternative to the widely used orthogonal frequency-division multiplexing (OFDM) method. Because WPM has overlapped symbols, equalization cannot rely on the use of the cyclic prefix (CP), which is used in OFDM. This study applies linear minimum mean-square error (MMSE) equalization in the time domain instead of in the frequency domain to achieve low computational complexity. With a modest equalizer filter length, the imperfection of MMSE equalization results in subcarrier attenuation and noise amplification, which are considered in the development of a bit-loading algorithm. Analytical expressions for the bit error rate (BER) performance are derived and validated using simulation results. A performance evaluation is carried out in different test scenarios as per Recommendation ITU-R M.1225. Numerical results show that WPM with equalization-aware bit loading outperforms OFDM with bit loading. Because previous comparisons between WPM and OFDM did not include bit loading, the results obtained provide additional evidence of the benefits of WPM over OFDM.

An Exploratory Study of Collaborative Filtering Techniques to Analyze the Effect of Information Amount

  • Hyun Sil Moon;Jung Hyun Yoon;Il Young Choi;Jae Kyeong Kim
    • Asia pacific journal of information systems
    • /
    • v.27 no.2
    • /
    • pp.126-138
    • /
    • 2017
  • The proliferation of items increased the difficulty of customers in finding the specific items they want to purchase. To solve this problem, companies adopted recommender systems, such as collaborative filtering systems, to provide personalization services. However, companies use only meaningful and essential data given the explosive growth of data. Some customers are concerned that their private information may be exposed because CF systems necessarily deal with personal information. Based on these concerns, we analyze the effects of the amount of information on recommendation performance. We assume that a customer could choose to provide overall information or partial information. Experimental results indicate that customers who provided overall information generally demonstrated high performance, but differences exist according to the characteristics of products. Our study can provide companies with insights concerning the efficient utilization of data.

Semantic Search and Recommendation of e-Catalog Documents through Concept Network (개념 망을 통한 전자 카탈로그의 시맨틱 검색 및 추천)

  • Lee, Jae-Won;Park, Sung-Chan;Lee, Sang-Keun;Park, Jae-Hui;Kim, Han-Joon;Lee, Sang-Goo
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.3
    • /
    • pp.131-145
    • /
    • 2010
  • Until now, popular paradigms to provide e-catalog documents that are adapted to users' needs are keyword search or collaborative filtering based recommendation. Since users' queries are too short to represent what users want, it is hard to provide the users with e-catalog documents that are adapted to their needs(i.e., queries and preferences). Although various techniques have beenproposed to overcome this problem, they are based on index term matching. A conventional Bayesian belief network-based approach represents the users' needs and e-catalog documents with their corresponding concepts. However, since the concepts are the index terms that are extracted from the e-catalog documents, it is hard to represent relationships between concepts. In our work, we extend the conventional Bayesian belief network based approach to represent users' needs and e-catalog documents with a concept network which is derived from the Web directory. By exploiting the concept network, it is possible to search conceptually relevant e-catalog documents although they do not contain the index terms of queries. Furthermore, by computing the conceptual similarity between users, we can exploit a semantic collaborative filtering technique for recommending e-catalog documents.

Development of a Book Recommender System for Internet Bookstore using Case-based Reasoning (사례기반 추론을 이용한 인터넷 서점의 서적 추천시스템 개발)

  • Lee, Jae-Sik;Myoung, Hun-Sik
    • The Journal of Society for e-Business Studies
    • /
    • v.13 no.4
    • /
    • pp.173-191
    • /
    • 2008
  • As volumes of electronic commerce increase rapidly, customers are faced with information overload, and it becomes difficult for them to find necessary information and select what they need. In this situation, recommender systems can help the customers search and select the products and services they need more conveniently. These days, the recommender systems play important roles in customer relationship management. In this research, we develop a recommender system that recommends the books to the customers of Internet bookstore. In previous researches on recommender systems, collaborative filtering technique has been often employed. For the collaborative filtering technique to be used, the rating scores on books given by previous purchasers have to be collected. However, the collection of rating scores is not an easy task in reality. Therefore, in this research, we employed case-based reasoning technique that can work only with the book purchase history of customers. The accuracy of recommendation of the resulting book recommender system was about 40% on the level 3 classification code.

  • PDF

Design of DCT/IDCT Core Processor using Module Generator Technique (모듈생성 기법을 이용한 DCT/IDCT 코어 프로세서의 설계)

  • 황준하;한택돈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.10
    • /
    • pp.1433-1443
    • /
    • 1993
  • DCT(Discrete Cosine Transform) / IDCT(Inverse DCT) is widely used in various image compression and decompression systems as well as in DSP(Digital Signal Processing) applications. Since DCT/ IDCT is one of the most complicated part of the compression system, the performance of the system can be greatly enchanced by improving the speed of DCT/IDCT operation. In this thesis, we designed a DCT/IDCT core processor using module generator technique. By utilizing the partial sum and DA(Distributed Arithmetic) techniques, the DCT/ IDCT core processor is designed within small area. It is also designed to perform the IDCT(Inverse DCT) operation with little additional circuitry. The pipeline structure of the core processor enables the high performance, and the high accuracy of the DCT/IDCT operation is obtained by having fewer rounding stages. The proposed design is independent of design rules, and the number of the input bits and the accuracy of the internal calculation coa be easily adjusted due to the module generator technique. The accuracy of the processor satisfies the specifications in CCITT recommendation H, 261.

  • PDF

Predictive Clustering-based Collaborative Filtering Technique for Performance-Stability of Recommendation System (추천 시스템의 성능 안정성을 위한 예측적 군집화 기반 협업 필터링 기법)

  • Lee, O-Joun;You, Eun-Soon
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.1
    • /
    • pp.119-142
    • /
    • 2015
  • With the explosive growth in the volume of information, Internet users are experiencing considerable difficulties in obtaining necessary information online. Against this backdrop, ever-greater importance is being placed on a recommender system that provides information catered to user preferences and tastes in an attempt to address issues associated with information overload. To this end, a number of techniques have been proposed, including content-based filtering (CBF), demographic filtering (DF) and collaborative filtering (CF). Among them, CBF and DF require external information and thus cannot be applied to a variety of domains. CF, on the other hand, is widely used since it is relatively free from the domain constraint. The CF technique is broadly classified into memory-based CF, model-based CF and hybrid CF. Model-based CF addresses the drawbacks of CF by considering the Bayesian model, clustering model or dependency network model. This filtering technique not only improves the sparsity and scalability issues but also boosts predictive performance. However, it involves expensive model-building and results in a tradeoff between performance and scalability. Such tradeoff is attributed to reduced coverage, which is a type of sparsity issues. In addition, expensive model-building may lead to performance instability since changes in the domain environment cannot be immediately incorporated into the model due to high costs involved. Cumulative changes in the domain environment that have failed to be reflected eventually undermine system performance. This study incorporates the Markov model of transition probabilities and the concept of fuzzy clustering with CBCF to propose predictive clustering-based CF (PCCF) that solves the issues of reduced coverage and of unstable performance. The method improves performance instability by tracking the changes in user preferences and bridging the gap between the static model and dynamic users. Furthermore, the issue of reduced coverage also improves by expanding the coverage based on transition probabilities and clustering probabilities. The proposed method consists of four processes. First, user preferences are normalized in preference clustering. Second, changes in user preferences are detected from review score entries during preference transition detection. Third, user propensities are normalized using patterns of changes (propensities) in user preferences in propensity clustering. Lastly, the preference prediction model is developed to predict user preferences for items during preference prediction. The proposed method has been validated by testing the robustness of performance instability and scalability-performance tradeoff. The initial test compared and analyzed the performance of individual recommender systems each enabled by IBCF, CBCF, ICFEC and PCCF under an environment where data sparsity had been minimized. The following test adjusted the optimal number of clusters in CBCF, ICFEC and PCCF for a comparative analysis of subsequent changes in the system performance. The test results revealed that the suggested method produced insignificant improvement in performance in comparison with the existing techniques. In addition, it failed to achieve significant improvement in the standard deviation that indicates the degree of data fluctuation. Notwithstanding, it resulted in marked improvement over the existing techniques in terms of range that indicates the level of performance fluctuation. The level of performance fluctuation before and after the model generation improved by 51.31% in the initial test. Then in the following test, there has been 36.05% improvement in the level of performance fluctuation driven by the changes in the number of clusters. This signifies that the proposed method, despite the slight performance improvement, clearly offers better performance stability compared to the existing techniques. Further research on this study will be directed toward enhancing the recommendation performance that failed to demonstrate significant improvement over the existing techniques. The future research will consider the introduction of a high-dimensional parameter-free clustering algorithm or deep learning-based model in order to improve performance in recommendations.

Generator of Dynamic User Profiles Based on Web Usage Mining (웹 사용 정보 마이닝 기반의 동적 사용자 프로파일 생성)

  • An, Kye-Sun;Go, Se-Jin;Jiong, Jun;Rhee, Phill-Kyu
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.389-390
    • /
    • 2002
  • It is important that acquire information about if customer has some habit in electronic commerce application of internet base that led in recommendation service for customer in dynamic web contents supply. Collaborative filtering that has been used as a standard approach to Web personalization can not get rapidly user's preference change due to static user profiles and has shortcomings such as reliance on user ratings, lack of scalability, and poor performance in the high-dimensional data. In order to overcome this drawbacks, Web usage mining has been prevalent. Web usage mining is a technique that discovers patterns from We usage data logged to server. Specially. a technique that discovers Web usage patterns and clusters patterns is used. However, the discovery of patterns using Afriori algorithm creates many useless patterns. In this paper, the enhanced method for the construction of dynamic user profiles using validated Web usage patterns is proposed. First, to discover patterns Apriori is used and in order to create clusters for user profiles, ARHP algorithm is chosen. Before creating clusters using discovered patterns, validation that removes useless patterns by Dempster-Shafer theory is performed. And user profiles are created dynamically based on current user sessions for Web personalization.

A Study of the Beauty Commerce Customer Segment Classification and Application based on Machine Learning: Focusing on Untact Service (머신러닝 기반의 뷰티 커머스 고객 세그먼트 분류 및 활용 방안: 언택트 서비스 중심으로)

  • Sang-Hyeak Yoon;Yoon-Jin Choi;So-Hyun Lee;Hee-Woong Kim
    • Information Systems Review
    • /
    • v.22 no.4
    • /
    • pp.75-92
    • /
    • 2020
  • As population and generation structures change, more and more customers tend to avoid facing relation due to the development of information technology and spread of smart phones. This phenomenon consists with efficiency and immediacy, which are the consumption patterns of modern customers who are used to information technology, so offline network-oriented distribution companies actively try to switch their sales and services to untact patterns. Recently, untact services are boosted in various fields, but beauty products are not easy to be recommended through untact services due to many options depending on skin types and conditions. There have been many studies on recommendations and development of recommendation systems in the online beauty field, but most of them are the ones that develop recommendation algorithm using survey or social data. In other words, there were not enough studies that classify segments based on user information such as skin types and product preference. Therefore, this study classifies customer segments using machine learning technique K-prototypesalgorithm based on customer information and search log data of mobile application, which is one of untact services in the beauty field, based on which, untact marketing strategy is suggested. This study expands the scope of the previous literature by classifying customer segments using the machine learning technique. This study is practically meaningful in that it classifies customer segments by reflecting new consumption trend of untact service, and based on this, it suggests a specific plan that can be used in untact services of the beauty field.

Incorporating Social Relationship discovered from User's Behavior into Collaborative Filtering (사용자 행동 기반의 사회적 관계를 결합한 사용자 협업적 여과 방법)

  • Thay, Setha;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.2
    • /
    • pp.1-20
    • /
    • 2013
  • Nowadays, social network is a huge communication platform for providing people to connect with one another and to bring users together to share common interests, experiences, and their daily activities. Users spend hours per day in maintaining personal information and interacting with other people via posting, commenting, messaging, games, social events, and applications. Due to the growth of user's distributed information in social network, there is a great potential to utilize the social data to enhance the quality of recommender system. There are some researches focusing on social network analysis that investigate how social network can be used in recommendation domain. Among these researches, we are interested in taking advantages of the interaction between a user and others in social network that can be determined and known as social relationship. Furthermore, mostly user's decisions before purchasing some products depend on suggestion of people who have either the same preferences or closer relationship. For this reason, we believe that user's relationship in social network can provide an effective way to increase the quality in prediction user's interests of recommender system. Therefore, social relationship between users encountered from social network is a common factor to improve the way of predicting user's preferences in the conventional approach. Recommender system is dramatically increasing in popularity and currently being used by many e-commerce sites such as Amazon.com, Last.fm, eBay.com, etc. Collaborative filtering (CF) method is one of the essential and powerful techniques in recommender system for suggesting the appropriate items to user by learning user's preferences. CF method focuses on user data and generates automatic prediction about user's interests by gathering information from users who share similar background and preferences. Specifically, the intension of CF method is to find users who have similar preferences and to suggest target user items that were mostly preferred by those nearest neighbor users. There are two basic units that need to be considered by CF method, the user and the item. Each user needs to provide his rating value on items i.e. movies, products, books, etc to indicate their interests on those items. In addition, CF uses the user-rating matrix to find a group of users who have similar rating with target user. Then, it predicts unknown rating value for items that target user has not rated. Currently, CF has been successfully implemented in both information filtering and e-commerce applications. However, it remains some important challenges such as cold start, data sparsity, and scalability reflected on quality and accuracy of prediction. In order to overcome these challenges, many researchers have proposed various kinds of CF method such as hybrid CF, trust-based CF, social network-based CF, etc. In the purpose of improving the recommendation performance and prediction accuracy of standard CF, in this paper we propose a method which integrates traditional CF technique with social relationship between users discovered from user's behavior in social network i.e. Facebook. We identify user's relationship from behavior of user such as posts and comments interacted with friends in Facebook. We believe that social relationship implicitly inferred from user's behavior can be likely applied to compensate the limitation of conventional approach. Therefore, we extract posts and comments of each user by using Facebook Graph API and calculate feature score among each term to obtain feature vector for computing similarity of user. Then, we combine the result with similarity value computed using traditional CF technique. Finally, our system provides a list of recommended items according to neighbor users who have the biggest total similarity value to the target user. In order to verify and evaluate our proposed method we have performed an experiment on data collected from our Movies Rating System. Prediction accuracy evaluation is conducted to demonstrate how much our algorithm gives the correctness of recommendation to user in terms of MAE. Then, the evaluation of performance is made to show the effectiveness of our method in terms of precision, recall, and F1-measure. Evaluation on coverage is also included in our experiment to see the ability of generating recommendation. The experimental results show that our proposed method outperform and more accurate in suggesting items to users with better performance. The effectiveness of user's behavior in social network particularly shows the significant improvement by up to 6% on recommendation accuracy. Moreover, experiment of recommendation performance shows that incorporating social relationship observed from user's behavior into CF is beneficial and useful to generate recommendation with 7% improvement of performance compared with benchmark methods. Finally, we confirm that interaction between users in social network is able to enhance the accuracy and give better recommendation in conventional approach.