research-article

KDD Cup 2013 - author-paper identification challenge: second place team

Authors:

Dmitry Efimov,

Lucas Silva,

Benjamin SoleckiAuthors Info & Claims

KDD Cup '13: Proceedings of the 2013 KDD Cup 2013 Workshop

Article No.: 3, Pages 1 - 5

https://doi.org/10.1145/2517288.2517291

Published: 11 August 2013 Publication History

Get Access

Abstract

This paper describes our submission to the KDD Cup 2013 Track 1 Challenge: Author-Paper Indentification in the Microsoft Academic Search database. Our approach is based on Gradient Boosting Machine (GBM) of Friedman ([5]) and deep feature engineering. The method was second in the final standings with Mean Average Precision (MAP) of 0.98144, while the winning submission scored 0.98259.

References

[1]

C. J. C. Burges, R. Ragno, and Q. Le. Learning to Rank with Nonsmooth Cost Functions. In NIPS, pages 193--200, 2006.

Digital Library

Google Scholar

[2]

M. Diez, A. Varona, M. Penagarikano, L. Rodriguez-Fuentes, and G. Bordel. On the use of phone log-likelihood ratios as features in spoken language recognition. In Spoken Language Technology Workshop (SLT), 2012 IEEE, pages 274--279, 2012.

Crossref

Google Scholar

[3]

Y. Freund, R. Iyer, R. E. Shapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933--969, 2003.

Digital Library

Google Scholar

[4]

Y. Freund and R. Schapire. A decision-theoretic generalization of online learning and an application to boosting. J. Comput. System Sciences, 55:119--139, 1997.

Digital Library

Google Scholar

[5]

J. Friedman. Greedy function approximation: a gradient boosting machine. The Annals of Statistics, 29:1189--1232, 2001.

Crossref

Google Scholar

[6]

A. Galecki and T. Burzykowski. Linear Mixed-Effects Models Using R. Springer, 2013.

Digital Library

Google Scholar

[7]

Q. Wu, C. J. C. Burges, K. M. Svore, and J. Gao. Ranking, boosting, and model adaptation, 2008.

Google Scholar

[8]

G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing and Management, 24(5):513--523, 1988.

Digital Library

Google Scholar

[9]

S. B. Roy, M. Cock, V. Mandava, B. Dalessandro, C. Perlich, W. Cukierski, and B. Hamner. The microsoft academic search dataset and kdd cup 2013, 2013.

Google Scholar

[10]

S. Wang, H. Chen, and X. Yao. Negative correlation learning for classification ensembles. In WCCI 2010, Barcelona, Spain, pages 2893--2900. IEEE, 2010.

Crossref

Google Scholar

Cited By

View all

Dutta HChakraborty T(2022)Blackmarket-Driven Collusion on Online Media: A SurveyACM/IMS Transactions on Data Science10.1145/35179312:4(1-37)Online publication date: 17-May-2022
https://dl.acm.org/doi/10.1145/3517931
Chen BZhang JTang JCai LWang ZZhao SChen HLi C(2022)CONNA: Addressing Name Disambiguation on the FlyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.302125634:7(3139-3152)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TKDE.2020.3021256
Lin YXie LWang CBu YLu S(2021)DropMonitorProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/34634965:2(1-22)Online publication date: 24-Jun-2021
https://dl.acm.org/doi/10.1145/3463496
Show More Cited By

Index Terms

KDD Cup 2013 - author-paper identification challenge: second place team
1. Computing methodologies
  1. Machine learning
2. Information systems
  1. Information systems applications
    1. Data mining

Recommendations

Feature engineering and tree modeling for author-paper identification challenge
KDD Cup '13: Proceedings of the 2013 KDD Cup 2013 Workshop

The ability to search literature and collect/aggregate metrics around publications is a central tool for modern research. Both academic and industry researchers across hundreds of scientific disciplines, from astronomy to zoology, increasingly rely on ...
KDD Cup and workshop 2007
Special issue on visual analytics

The KDD Cup is the oldest of the many data mining competitions that are now popular [1]. It is an integral part of the annual ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). In 2007, the traditional KDD Cup competition ...
Logistic Model Trees with AUC split criterion for the KDD cup 2009 small challenge
KDD-CUP'09: Proceedings of the 2009 International Conference on KDD-Cup 2009 - Volume 7

In this work, we describe our approach to the "Small Challenge" of the KDD cup 2009, a classification task with incomplete data. Preprocessing, feature extraction and model selection are documented in detail. We suggest a criterion based on the number ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

KDD Cup '13: Proceedings of the 2013 KDD Cup 2013 Workshop

August 2013

69 pages

ISBN:9781450324953

DOI:10.1145/2517288

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: 11 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

KDD' 13

Sponsor:

KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 11 - 14, 2013

Illinois, Chicago

Upcoming Conference

KDD '25

Sponsor:
sigkdd
sigkdd

The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining

August 3 - 7, 2025

Toronto , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
262
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dutta HChakraborty T(2022)Blackmarket-Driven Collusion on Online Media: A SurveyACM/IMS Transactions on Data Science10.1145/35179312:4(1-37)Online publication date: 17-May-2022
https://dl.acm.org/doi/10.1145/3517931
Chen BZhang JTang JCai LWang ZZhao SChen HLi C(2022)CONNA: Addressing Name Disambiguation on the FlyIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.302125634:7(3139-3152)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TKDE.2020.3021256
Lin YXie LWang CBu YLu S(2021)DropMonitorProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/34634965:2(1-22)Online publication date: 24-Jun-2021
https://dl.acm.org/doi/10.1145/3463496
Lee JElhaouij NPicard R(2021)AmbientBreathProceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies10.1145/34634935:2(1-30)Online publication date: 24-Jun-2021
https://dl.acm.org/doi/10.1145/3463493
Messina NAmato GEsuli AFalchi FGennaro CMarchand-Maillet S(2021)Fine-Grained Visual Textual Alignment for Cross-Modal Retrieval Using Transformer EncodersACM Transactions on Multimedia Computing, Communications, and Applications10.1145/345139017:4(1-23)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3451390
Zhang CYao HYu LHuang CSong DChen HJiang MChawla N(2021)Inductive Contextual Relation Learning for PersonalizationACM Transactions on Information Systems10.1145/345035339:3(1-22)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1145/3450353
Zhao GHassan SZou YTruong DCorbin T(2021)Predicting Performance Anomalies in Software Systems at Run-timeACM Transactions on Software Engineering and Methodology10.1145/344075730:3(1-33)Online publication date: 23-Apr-2021
https://dl.acm.org/doi/10.1145/3440757
Gao PXie HSong FChen T(2021)A Hybrid Approach to Formal Verification of Higher-Order Masked Arithmetic ProgramsACM Transactions on Software Engineering and Methodology10.1145/342801530:3(1-42)Online publication date: 11-Feb-2021
https://dl.acm.org/doi/10.1145/3428015
Park CKim DZhu QHan JYu HZhu WTao DCheng XCui PRundensteiner ECarmel DHe QXu Yu J(2019)Task-Guided Pair Embedding in Heterogeneous NetworkProceedings of the 28th ACM International Conference on Information and Knowledge Management10.1145/3357384.3357982(489-498)Online publication date: 3-Nov-2019
https://dl.acm.org/doi/10.1145/3357384.3357982
Zhang CYu LZhang XChawla N(2018)Task-guided and semantic-aware ranking for academic author-paper correlation inferenceProceedings of the 27th International Joint Conference on Artificial Intelligence10.5555/3304222.3304274(3641-3647)Online publication date: 13-Jul-2018
https://dl.acm.org/doi/10.5555/3304222.3304274
Show More Cited By

View Options

Login options

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

Cited By

Index Terms

Recommendations

Feature engineering and tree modeling for author-paper identification challenge

KDD Cup and workshop 2007

Logistic Model Trees with AUC split criterion for the KDD cup 2009 small challenge