论文信息 - Project Entity Matching across FLOSS Repositories

Project Entity Matching across FLOSS Repositories

Much of the data about free, libre, and open source (FLOSS) software development comes from studies of code repositories used for managing projects. This paper presents a method for integrating data about open source projects by way of matching projects (entities) and deleting duplicates across multiple code repositories. After a review of the relevant literature, a few of the methods are chosen and applied to the FLOSS domain, including a simple scoring system for confidence in pairwise project matches. Finally, the paper describes limitations of this approach and recommendations for future work.

Megan Conklin

[1] Byung-Won On,et al. Comparative study of name disambiguation problem using a scalable blocking-based framework , 2005, Proceedings of the 5th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '05).

[2] Megan Conklin. Beyond Low-Hanging Fruit: Seeking the Next Generation in FLOSS Data Mining , 2006, OSS.

[3] Erhard Rahm,et al. A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[4] Kevin Crowston,et al. FLOSSmole: A Collaborative Repository for FLOSS Research Data and Analyses , 2006, Int. J. Inf. Technol. Web Eng..

[5] William E. Winkler,et al. The State of Record Linkage and Current Research Problems , 1999 .

[6] Jiawei Han,et al. Object Matching for Information Integration: A Profiler-Based Approach , 2003, IIWeb.

[7] Hector Garcia-Molina,et al. Generic Entity Resolution with Data Confidences , 2006, CleanDB.

[8] Jesús M. González-Barahona,et al. Developer identification methods for integrated data from various sources , 2005, ACM SIGSOFT Softw. Eng. Notes.

[9] Pedro M. Domingos,et al. Reconciling schemas of disparate data sources: a machine-learning approach , 2001, SIGMOD '01.