skip to main content
10.1145/2875913.2875936acmotherconferencesArticle/Chapter ViewAbstractPublication PagesinternetwareConference Proceedingsconference-collections
short-paper

An Entropy-based Approach to the Crowd Entity Resolution

Authors Info & Claims
Published:06 November 2015Publication History

ABSTRACT

Crowdsourcing is used to obtain needed ideas and content by soliciting data from a large group of people, especially from an online community. However, the data generated by a group of people is duplicated. As to learn the crowd intention based on the crowd data, we need to do some entity resolution works. Previous works focus on data matching and merging, but remain far from perfect in crowdsourcing area. In our study, we propose a generic way in measuring and representing the crowd intention based on the crowd data. The main contribution of our study is twofold: 1. We propose a graph structure that represents the crowd intention. 2. We propose an entropy-based measurement that evaluates the diversity of the crowd intention.

References

  1. Anhai Doan, Raghu Ramakrishnan, Alon Y. Halevy, "Crowdsourcing systems on the world-wide web," Communications of the ACM, vol. 54, no. 3, 2011 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios, "Duplicate record detection: A survey. Knowledge and Data Engineering," IEEE Transactions, vol. 19, no. 1, 2007, pp. 1-- 16. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Benjelloun, Omar, Hector Garcia-Molina, et al., "Swoosh: a generic approach to entity resolution," The VLDB Journal--- The International Journal on Very Large Data Bases, vol. 18, no. 1, 2009, pp. 255--276. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dehmer, Matthias, and Abbe Mowshowitz, "A history of graph entropy measures," Information Sciences, vol. 181, no.1, 2011, pp. 57--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Jeff Howe, "The rise of crowdsourcing." Wired magazine, vol. 14, no.6, 2006, pp. 1--4.Google ScholarGoogle Scholar
  6. Jiannan Wang, Tim Kraska, Michael J. Franklin, and Jianhua Feng, "Crowder: Crowdsourcing entity resolution," Proceedings of the VLDB Endowment 5, no. 11, 2012, pp. 1483--1494. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Köpcke, Hanna, Andreas Thor, and Erhard Rahm, "Evaluation of entity resolution approaches on real-world match problems," Proceedings of the VLDB Endowment, vol. 3, no. 1-2, 2010, pp. 484--493. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Sabetzadeh and S.M. Easterbrook, "View Merging in the Presence of Incompleteness and Inconsistency," Requirements Eng., vol. 11, no. 3, 2006, pp. 174--193. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Nejati et al., "Matching and Merging of Variant Feature Specifications," IEEE Trans. Software Eng., vol. 38, no. 6, 2012, pp. 1355--1375. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An Entropy-based Approach to the Crowd Entity Resolution

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      Internetware '15: Proceedings of the 7th Asia-Pacific Symposium on Internetware
      November 2015
      247 pages
      ISBN:9781450336413
      DOI:10.1145/2875913

      Copyright © 2015 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 6 November 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper
      • Research
      • Refereed limited

      Acceptance Rates

      Overall Acceptance Rate55of111submissions,50%
    • Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader