• Title/Summary/Keyword: paper recommendation

Search Result 1,134, Processing Time 0.027 seconds

A Design and Implementation of the M-Commerce Recommendation System using Web Mining (웹마이닝을 이용한 M-Commerce 추천시스템 설계 및 구현)

  • Lee, Kyong-Ho;Yoon, Chang-Hyun;Park, Doo-Soon
    • The Journal of Korean Association of Computer Education
    • /
    • v.6 no.3
    • /
    • pp.27-36
    • /
    • 2003
  • Rccommender systems are being used by an ever-increasing number of E-Commerce sites to help consumers find products to purchase. Recommender Systems offer a technology that allows personalized recommendations of items of potential interest to users based on information about similarities and dissimilarities among different user' tastes. However, despite enormous interest in recommender systems, both the number of available published techniques and information about their performance are limited. In this paper. we design and implement an M-Commerce recommendation systems using the past buying behavior of the consumer, consumer information, and association rule mining.

  • PDF

Parallel Processing Architecture for Parity Checksum Generator Complying with ITU-T J.83 ANNEX B (ITU-T J.83 ANNEX B의 Parity Checksum Generator를 위한 병렬 처리 구조)

  • Lee, Jong-Yeop;Hong, Eon-Pyo;Har, Dong-Soo;Lim, Hai-Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6C
    • /
    • pp.619-625
    • /
    • 2009
  • This paper proposes a parallel architecture of a Parity Checksum Generator adopted for packet synchronization and error detection in the ITU-T Recommendation J.83 Annex B. The proposed parallel processing architecture removes a performance bottleneck occurred in a conventional serial processing architecture, leading to significant decrease in processing time for generating a Parity Checksum. The implementation results show that the proposed parallel processing architecture reduces the processing time by 83.1% at the expense of 16% area increase.

Nearest Neighbor Query Processing using the Direction of Mobile Object (모바일 객체의 방향성을 고려한 최근접 질의 처리)

  • Lee, Eung-Jae;Jung, Young-Jin;Choi, Hyon-Mi;Ryu, Keun-Ho;Lee, Seong-Ho
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.1 s.11
    • /
    • pp.59-71
    • /
    • 2004
  • Nearest neighbor query retrieves nearest located target objects, and is very frequently used in mobile environment. In this paper we propose a novel neatest neighbor query processing technique that is able to retrieve nearest located target object from the user who is continuously moving with a direction. The proposed method retrieves objects using the direction property of moving object as well as euclidean distance to target object. The proposed method is applicable to traffic information system, travel information system, and location-based recommendation system which require retrieving nearest located object.

  • PDF

Definition and Difference between Dose Equivalent and Equivalent Dose in Radiation Dose Measurement and Evaluation (방사선량의 측정, 평가에서 선량당량(dose equivalent)과 등가선량(equivalent dose)의 정의 및 차이)

  • Chang, Si-Young
    • Journal of Radiation Protection and Research
    • /
    • v.18 no.1
    • /
    • pp.1-7
    • /
    • 1993
  • In its recent recommendation No. 60(1990), ICRP has newly introduced several terminology which had not existed in its prior recommendation No. 26(1977). Of these, a newly defined quantity 'Equivalent Dose' replacing the 'Dose Equivalent' of the ICRU concept has been recommended to be adopted in the radiation protection programme. However, since the committee still uses the 'Dose Equivalent' and 'Equivalent Dose' in its several publications, it is likely to provoke unnecessary confusions and misuses in applying these two quantities. In this paper were described the definition and difference between these two quantities to help in understanding of these two quantitites among the person involved in the radiation protection activities.

  • PDF

Implementation of Demo Program for Visual Communication in Compliance with MPEG-21 Part 22: User Description (MPEG-UD 표준을 준수하는 비쥬얼 커뮤니케이션 데모 프로그램 개발)

  • Lim, Hea-Jin;Choi, Jang-Sik;Jeon, Jin-Young;Byun, Hyung-Gi
    • Journal of Sensor Science and Technology
    • /
    • v.25 no.4
    • /
    • pp.297-301
    • /
    • 2016
  • ISO/IEC JTC1/SC29WG11 MPEG has been standardizing UD(user description) to give a user personalized recommendation services. Besides, CD(context description), service description(SD), and recommendation description(RD) are recently being standardized by UD Adhoc Group in MPEG with an advanced UD to cope with needs of current and upcoming services such as augmented reality and social network. The descriptions was reflected to MPEG-UD WD(Working Draft) at MPEG $107^{th}$ meeting and the document was finally approved as international standard by national bodies with standard number(ISO/IEC IS 21000-22 UD) at $114^{th}$ MPEG meeting. In addition, reference software WD to validate conformance of UD standard was approved at $113^{th}$ MPEG meeting. In this paper, we developed a demo program for visual communication according to guideline defined in reference software WD to validate the reference software as well as UD standard.

Development of Recommendation Agents through Web Log Analysis (웹 로그 분석을 이용한 추천 에이전트의 개발)

  • 김성학;이창훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.10
    • /
    • pp.621-630
    • /
    • 2003
  • Web logs are the information recorded by a web server when users access the web sites, and due to a speedy rising of internet usage, the worth of their practical use has become increasingly important. Analyzing such logs can use to determine the patterns representing users' navigational behavior in a Web site and restructure a Web site to create a more effective organizational presence. For these applications, the generally used key methods in many studies are association rules and sequential patterns based by Apriori algorithms, which are widely used to extract correlation among patterns. But Apriori inhere inefficiency in computing cost when applied to large databases. In this paper, we develop a new algorithm for mining interesting patterns which is faster than Apriori algorithm and recommendation agents which could provide a system manager with valuable information that are accessed sequentially by many users.

  • PDF

A Call Recommendation Algorithm Design and Verification with ESM (통화 상대 추천 알고리즘 디자인 및 ESM을 통한 평가)

  • Lee, Seung-Hwan;Seo, Jung-Suk;Lee, Gee-Hyuk
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.357-362
    • /
    • 2009
  • We propose a method to recommend most likely people to call based on call log of mobile phone user. Call logs of an user can reflect calling pattern of the user include regular calling behavior. When user got a list of people to call with a click of 'send' button on the phone, the time and effort to search a person with several typing or to select a person from the list can be definitely reduced. This paper presents the design process of an algorithm to find most likely people to call at a certain moment and the verification process with recorded call log and Experience Sampling Method(ESM) on mobile phone.

  • PDF

Personalized Bookmark Search Word Recommendation System based on Tag Keyword using Collaborative Filtering (협업 필터링을 활용한 태그 키워드 기반 개인화 북마크 검색 추천 시스템)

  • Byun, Yeongho;Hong, Kwangjin;Jung, Keechul
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1878-1890
    • /
    • 2016
  • Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

Weighted Markov Model for Recommending Personalized Broadcasting Contents (개인화된 방송 컨텐츠 추천을 위한 가중치 적용 Markov 모델)

  • Park, Sung-Joon;Hong, Jong-Kyu;Kang, Sang-Gil;Kim, Young-Kuk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.5
    • /
    • pp.326-338
    • /
    • 2006
  • In this paper, we propose the weighted Markov model for recommending the users' prefered contents in the environment with considering the users' transition of their content consumption mind according to the kind of contents providing in time. In general, TV viewers have an intention to consume again the preferred contents consumed in recent by them. In order to take into the consideration, we modify the preference transition matrix by providing weights to the consecutively consumed contents for recommending the users' preferred contents. We applied the proposed model to the recommendation of TV viewer's genre preference. The experimental result shows that our method is more efficient than the typical methods.

Malware Family Recommendation using Multiple Sequence Alignment (다중 서열 정렬 기법을 이용한 악성코드 패밀리 추천)

  • Cho, In Kyeom;Im, Eul Gyu
    • Journal of KIISE
    • /
    • v.43 no.3
    • /
    • pp.289-295
    • /
    • 2016
  • Malware authors spread malware variants in order to evade detection. It's hard to detect malware variants using static analysis. Therefore dynamic analysis based on API call information is necessary. In this paper, we proposed a malware family recommendation method to assist malware analysts in classifying malware variants. Our proposed method extract API call information of malware families by dynamic analysis. Then the multiple sequence alignment technique was applied to the extracted API call information. A signature of each family was extracted from the alignment results. By the similarity of the extracted signatures, our proposed method recommends three family candidates for unknown malware. We also measured the accuracy of our proposed method in an experiment using real malware samples.