z-logo
Premium
The development and validation of a one‐bit comparison for evaluating the maturity of tag distributions in a W eb 2.0 environment
Author(s) -
Tang KuoHao,
Tsai LiChen,
Hwang SheueLing
Publication year - 2016
Publication title -
journal of the association for information science and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.903
H-Index - 145
eISSN - 2330-1643
pISSN - 2330-1635
DOI - 10.1002/asi.23454
Subject(s) - computer science , information retrieval , entropy (arrow of time) , set (abstract data type) , resource (disambiguation) , metric (unit) , world wide web , domain (mathematical analysis) , data science , computer network , mathematical analysis , operations management , physics , mathematics , quantum mechanics , economics , programming language
Tags generated by domain experts reaching a consensus under social influence reflect the core concepts of the tagged resource. Such tags can act as navigational cues that enable users to discover meaningful and relevant information in a W eb 2.0 environment. This is particularly critical for nonexperts for understanding formal academic or scientific resources, also known as hard content. The goal of this study was to develop a novel one‐bit comparison ( OBC ) metric and to assess in what circumstances a set of tags describing a hard‐content resource is mature and representative. We compared OBC with the conventional S hannon entropy approach to determine performance when distinguishing tags generated by domain experts and nonexperts in the early and later stages under social influence. The results indicated that OBC can accurately distinguish mature tags generated by a strong expert consensus from other tags, and outperform S hannon entropy. The findings support tag‐based learning, and provide insights and tools for the design of applications involving tags, such as tag recommendation and tag‐based organization.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here