• Title/Summary/Keyword: Tag Ranking

Search Result 15, Processing Time 0.027 seconds

Tag Ranking System based on Semantic Similarity of Tag-pair (태그쌍의 의미유사도 기반 태그 랭킹 시스템)

  • Lee, Si-Hwa;Hwang, Dae-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.11
    • /
    • pp.1305-1314
    • /
    • 2013
  • The existing tag based system deducts a retrieval result with low accuracy through the usage of a single tag matching by using tags tagged in contents. And the system doesn't provide effectively contents related information which the tags have, as the users place tags on contents without considering the priority and associative relation between tags. For a solve of above problems, this paper suggests a tag ranking system which extracts semantic similarity between tags and re-ranks the tags tagged in contents. In order to evaluate the performance of suggested system, this paper experiments and compares the ranking result of this paper's tag ranking system with the result of baseline method using tags tagged in images and frequency method adapting tag co-appearance frequency.

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.

Tensor-based tag emotion aware recommendation with probabilistic ranking

  • Lim, Hyewon;Kim, Hyoung-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5826-5841
    • /
    • 2019
  • In our previous research, we proposed a tag emotion-based item recommendation scheme. The ternary associations among users, items, and tags are described as a three-order tensor in order to capture the emotions in tags. The candidates for recommendation are created based on the latent semantics derived by a high-order singular value decomposition technique (HOSVD). However, the tensor is very sparse because the number of tagged items is smaller than the amount of all items. The previous research do not consider the previous behaviors of users and items. To mitigate the problems, in this paper, the item-based collaborative filtering scheme is used to build an extended data. We also apply the probabilistic ranking algorithm considering the user and item profiles to improve the recommendation performance. The proposed method is evaluated based on Movielens dataset, and the results show that our approach improves the performance compared to other methods.

A Vector Tagging Method for Representing Multi-dimensional Index (다차원 인덱스를 위한 벡터형 태깅 연구)

  • Jung, Jae-Youn;Zin, Hyeon-Cheol;Kim, Chong-Gun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.9
    • /
    • pp.749-757
    • /
    • 2009
  • A Internet user can easily access to the target information by web searching using some key-words or categories in the present Internet environment. When some meta-data which represent attributes of several data structures well are used, then more accurate result which is matched with the intention of users can be provided. This study proposes a multiple dimensional vector tagging method for the small web user group who interest in maintaining and sharing the bookmark for common interesting topics. The proposed method uses vector tag method for increasing the effect of categorization, management, and retrieval of target information. The vector tag composes with two or more components of the user defined priority. The basic vector space is created time of information and reference value. The calculated vector value shows the usability of information and became the metric of ranking. The ranking accuracy of the proposed method compares with that of a simply link structure, The proposed method shows better results for corresponding the intention of users.

Ranking Tag Pairs for Music Recommendation Using Acoustic Similarity

  • Lee, Jaesung;Kim, Dae-Won
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.3
    • /
    • pp.159-165
    • /
    • 2015
  • The need for the recognition of music emotion has become apparent in many music information retrieval applications. In addition to the large pool of techniques that have already been developed in machine learning and data mining, various emerging applications have led to a wealth of newly proposed techniques. In the music information retrieval community, many studies and applications have concentrated on tag-based music recommendation. The limitation of music emotion tags is the ambiguity caused by a single music tag covering too many subcategories. To overcome this, multiple tags can be used simultaneously to specify music clips more precisely. In this paper, we propose a novel technique to rank the proper tag combinations based on the acoustic similarity of music clips.

Keywords Refinement using TextRank Algorithm (TextRank를 이용한 키워드 정련 -TextRank를 이용한 집단 지성에서 생성된 콘텐츠의 키워드 정련-)

  • Lee, Hyun-Woo;Han, Yo-Sub;Kim, Lae-Hyun;Cha, Jeong-Won
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.285-289
    • /
    • 2009
  • Tag is important to retrieve and classify contents. However, someone uses so many unrelated tags with contents for the high ranking In this work, we propose tag refinement algorithm using TextRank. We calculate the importance of keywords occurred a title, description, tag, and comments. We refine tags removing unrelated keywords from user generated tags. From the results of experiments, we can see that proposed method is useful for refining tags.

  • PDF

Timeline Tag Cloud Generation for Broadcasting Contents using Blog Postings (블로그 포스팅을 이용한 방송 콘텐츠 영상의 타임라인 단위 태그 클라우드 생성)

  • Son, Jeong-Woo;Kim, Hwa-Suk;Kim, Sun-Joong;Cho, Keeseong
    • Journal of KIISE
    • /
    • v.42 no.5
    • /
    • pp.637-641
    • /
    • 2015
  • Due to the recent increasement of user created contents like SNS, blog posts, and so on, broadcast contents are actively re-construction by its users. Especially, on some genres like drama, movie, various information from cars and film sites to clothes and watches in a content is spreaded out to other users through blog postings. Since such information can be an additional information for the content, they can be used for providing high-quality broadcast services. For this purpose, in this paper, we propose timeline tag cloud generation method for broadcasting contents. In the proposed method, blog postings on the target contents are first gathered and then, images and words around images are extracted from a blog post as a tag set. An extracted tag set is tagged on a specific timeline of the target content. In experiments, to prove the efficiency of the proposed method, we evaluated the performances of the proposed image matching and tag cloud generation methods.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

A Study on Recommender Technique Applying User Activity and Time Information (사용자 활동과 시간 정보를 적용한 추천 기법에 관한 연구)

  • Yun, So-Young;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.3
    • /
    • pp.543-551
    • /
    • 2015
  • As the use of internet and mobile devices became generalized, users utilizing search and recommendation in order to find the information they want in the midst of various websites have become common. In order to recommend more appropriate item for users, this paper proposes a recommendation technique that reflects the users' preference change following the flow of time by applying users' activity and time information. The proposed technique, after classifying the data in categories including the tag information that is considered at the time of choosing the items, only uses the data that users' preference change following the flow of time is reflected. For the users who prefer the corresponding category, the item that is extracted by applying tag information to collaboration filtering technique is recommended and for general users, items are recommended based on the ranking calculated by using the tag information. The proposed technique was experimented by using hetrec2011-movielens-2k data set. The experiment result indicated that the proposed technique has been more enhanced the accuracy, appropriacy, compared to item-based, user-based method.