• Title/Summary/Keyword: 소셜 북마크

Search Result 12, Processing Time 0.03 seconds

Personalized Bookmark Recommendation System Using Tag Network (태그 네트워크를 이용한 개인화 북마크 추천시스템)

  • Eom, Tae-Young;Kim, Woo-Ju;Park, Sang-Un
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.4
    • /
    • pp.181-195
    • /
    • 2010
  • The participation and share between personal users are the driving force of Web 2.0, and easily found in blog, social network, collective intelligence, social bookmarking and tagging. Among those applications, the social bookmarking lets Internet users to store bookmarks online and share them, and provides various services based on shared bookmarks which people think important.Delicious.com is the representative site of social bookmarking services, and provides a bookmark search service by using tags which users attach to the bookmarks. Our paper suggests a method re-ranking the ranks from Delicious.com based on user tags in order to provide personalized bookmark recommendations. Moreover, a method to consider bookmarks which have tags not directly related to the user query keywords is suggested by using tag network based on Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare the ranks by Delicious.com with new ranks of our system.

A Web Contents Ranking Algorithm using Bookmarks and Tag Information on Social Bookmarking System (소셜 북마킹 시스템에서의 북마크와 태그 정보를 활용한 웹 콘텐츠 랭킹 알고리즘)

  • Park, Su-Jin;Lee, Si-Hwa;Hwang, Dae-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1245-1255
    • /
    • 2010
  • In current Web 2.0 environment, one of the most core technology is social bookmarking which users put tags and bookmarks to their interesting Web pages. The main purpose of social bookmarking is an effective information service by use of retrieval, grouping and share based on user's bookmark information and tagging result of their interesting Web pages. But, current social bookmarking system uses the number of bookmarks and tag information separately in information retrieval, where the number of bookmarks stand for user's degree of interest on Web contents, information retrieval, and classification serve the purpose of tag information. Because of above reason, social bookmarking system does not utilize effectively the bookmark information and tagging result. This paper proposes a Web contents ranking algorithm combining bookmarks and tag information, based on preceding research on associative tag extraction by tag clustering. Moreover, we conduct a performance evaluation comparing with existing retrieval methodology for efficiency analysis of our proposed algorithm. As the result, social bookmarking system utilizing bookmark with tag, key point of our research, deduces a effective retrieval results compare with existing systems.

A Web Contents Ranking System using Related Tag & Similar User Weight (연관 태그 및 유사 사용자 가중치를 이용한 웹 콘텐츠 랭킹 시스템)

  • Park, Su-Jin;Lee, Si-Hwa;Hwang, Dae-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.4
    • /
    • pp.567-576
    • /
    • 2011
  • In current Web 2.0 environment, one of the most core technology is social bookmarking which users put tags and bookmarks to their interesting Web pages. The main purpose of social bookmarking is an effective information service by use of retrieval, grouping and share based on user's bookmark information and tagging result of their interesting Web pages. But, current social bookmarking system uses the number of bookmarks and tag information separately in information retrieval, where the number of bookmarks stand for user's degree of interest on Web contents, information retrieval, and classification serve the purpose of tag information. Because of above reason, social bookmarking system does not utilize effectively the bookmark information and tagging result. This paper proposes a Web contents ranking algorithm combining bookmarks and tag information, based on preceding research on associative tag extraction by tag clustering. Moreover, we conduct a performance evaluation comparing with existing retrieval methodology for efficiency analysis of our proposed algorithm. As the result, social bookmarking system utilizing bookmark with tag, key point of our research, deduces a effective retrieval results compare with existing systems.

Automated Video Clip Creation Using Time-based Social Bookmark Clustering (소셜 북마크의 시간 정보 클러스터링을 이용한 비디오 클립 생성 자동화)

  • Han, Sung-Hee;Lee, Jae-Ho;Kang, Dae-Kap
    • Journal of Broadcast Engineering
    • /
    • v.15 no.1
    • /
    • pp.144-147
    • /
    • 2010
  • Recently the change of content consumption trend activated the social video sharing platform and the video clip itself. There have been intensive interests and efforts to automatically abstract compact and meaningful video clips. In this paper, we propose a method which use the clustering of the bookmark data created by collective intelligence instead of using the video content analysis. The partitional clustering of points in 2-dimensional space derived from the bookmark data make it possible to abstract highlights effectively. The method is enhanced by the 1-dimensional accumulated bookmark count graph. Experiments on the real data from KBS internet service show the effectiveness of the proposed method.

Hot issue extraction method using FOAF and Social Network Analysis (FOAF및 소셜 네트워크 분석을 이용한 핫 이슈 추출 기법)

  • Wang, Qing;Sohn, Jongsoo;Chung, InJeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.531-534
    • /
    • 2010
  • 웹 2.0의 적극적인 도입에 따라 소셜 네트워크 기반 커뮤니티 사이트에서는 관련된 콘텐츠를 적절하게 추천하는 것은 중요한 문제로 부각되고 있으며 이로 인해 사용자들의 동향 및 이슈 추출 기법이 중요하게 작용하고 있다. 이러기 위해서 지금까지의 연구에서는 콘텐츠에 포함된 키워드 매칭 방법을 이용하고 있으나 사용자들 간의 연결 관계와 키워드의 중요도를 고려하지 못하고 있다. 본 논문에서는 FOAF 기반의 소셜 네트워크와 del.icio.us에서 제공하는 소셜 북마크 데이터를 기초로 소셜네트워크 분석을 보이며 이를 통한 사용자들 사이에서 중요하게 부각되는 핫 이슈를 추출하는 방법을 제안한다. 본 논문에서 제안하는 핫 이슈 추출 방법을 활용하면 사용자들의 관심 분야 동향파악을 효율적으로 수행할 수 있으며 이를 통해 맞춤형 마케팅 및 콘텐츠 추천이 가능해 진다.

Sketch-based Visual Bookmarking for Trip Planner System (스케치 기반의 비주얼 북마킹을 이용한 여행 플래너 시스템)

  • Lee, Ha-Young;Kim, Hyo-Woo;Jeon, Jae-Woong;Choy, Yoon-Chul
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.442-444
    • /
    • 2012
  • 소셜 미디어 환경의 도래로 다수의 사용자들이 자신만의 콘텐츠를 생성하고 공유하는 일이 많아졌다. 특히 여행이 대중적 취미로 자리잡으면서 여행에 관련된 콘텐츠도 늘어나고 있다. 하지만 여행 콘텐츠를 위한 효율적 시스템은 많지 않으며 기능이 미약하거나 복잡한 인터페이스로 인해 사용률이 낮은 편이다. 따라서 본 논문에서는 이를 보완하기 위하여 스케치 기반의 비주얼 북마킹을 이용한 여행 플래너 시스템을 제안한다. 사용자가 스케치와 제스처를 사용한 비주얼 북마킹을 이용하여 여행지에 관련한 자료를 간단한 태그를 붙여 북마크를 생성하면 지도 위에 자동으로 북마크가 생성되어 사용자는 북마크의 위치를 보고 루트를 정할 수 있다. 이를 이용하여 사용자는 여행의 목적을 잘 표현할 수 있는 여행 일정을 쉽고 다양하게 작성할 수 있다. 또한 사용자가 자신만의 여행 후기를 정리하여 다른 사람들과 쉽게 공유할 수 있는 도구로 활용될 수 있다.

Measuring Web Page Similarity using Tags (태그를 이용한 웹 페이지간의 유사도 측정 방법)

  • Kang, Sang-Wook;Lee, Ki-Yong;Kim, Hyeon-Gyu;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.37 no.2
    • /
    • pp.104-112
    • /
    • 2010
  • Social bookmarking is one of the most interesting trends in the current web environment. In a social bookmarking system, users annotate a web page with tags, which describe the contents of the page. Numerous studies have been done using this information, mostly on enhancing the quality of web search. In this paper, we use this information to measure the semantic similarity between two web pages. Since web pages consist of various types of multimedia data, it is quite difficult to compare the semantics of two web pages by comparing the actual data contained in the pages. With the help of social bookmarks, this comparison can be performed very effectively. In this paper, we propose a new similarity measure between web pages, called Web Page Similarity Based on Entire Tags (WSET), based on social bookmarks. The experimental results show that the proposed measure yields more satisfactory results than the previous ones.

A Collaborative URL Tagging Scheme using Browser Bookmark Categories as Keyword Support for Webpage Sharing (브라우저 북마크 분류를 키워드로 사용하는 웹페이지 공유를 위한 협동적 URL 태깅 방식)

  • Encarnacion, Nico;Yang, Hyun-Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.12
    • /
    • pp.1911-1916
    • /
    • 2013
  • One significant challenge that arises in social tagging systems is the rapid increase in the number and diversity of the tags. As opposed to structured annotation systems, tags provide users an unstructured, open-ended mechanism to annotate and organize web-content. In this paper, we propose a scheme for URL recommendation that is based on a folksonomy which is comprised of user-defined tags, URL-keywords and the category folder name as the major element. This scheme will be further improved and implemented on a browser extension that recommends to users the best way to classify a particular URL.

A Study of the Intelligent Researcher Connection Network Build-up that Merges the Recommendation System and Social Network (추천시스템과 소셜 네트워크를 융합한 지능형 연구자연결망 구축)

  • Lee, Choong-Moo;Lee, Sang-Gi;Lee, Byeong-Seop
    • Journal of Information Management
    • /
    • v.40 no.1
    • /
    • pp.199-215
    • /
    • 2009
  • The web 2.0 concept rapidly spreads to the various field which is based on an opening, the participation, and a share. And the research about the recommendation system, that is the personalize feature, and social network is very active. In the case of the recommendation system and social network, it had been developing in the respectively different area and the new research toward the service model of a form that it fuses these is insignificant. In this paper, I'm going to introduce efficient social network which is called the researcher connection network. It is possible to recommend the researcher intellectually who studies the similar field by analyzing the usage log and user profile. Through this study, we could solved the network expandability problem which is due to the user passive participation and the difficulty of the initial network construction that is the conventional social network problem.

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.