Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2023
Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 4068–4077https://doi.org/10.1145/3580305.3599933Yggdrasil Decision Forests is a library for the training, serving and interpretation of decision forest models, targeted both at research and production work, implemented in C++, and available in C++, command line interface, Python (under the name ...
- ArticleOctober 2020
Extreme Gradient Boosted Multi-label Trees for Dynamic Classifier Chains
AbstractClassifier chains is a key technique in multi-label classification, since it allows to consider label dependencies effectively. However, the classifiers are aligned according to a static order of the labels. In the concept of dynamic classifier ...
- short-paperNovember 2019
Hybrid Deep Pairwise Classification for Author Name Disambiguation
CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge ManagementPages 2369–2372https://doi.org/10.1145/3357384.3358153Author name disambiguation (AND) can be defined as the problem of clustering together unique authors from all author mentions that have been extracted from publication or related records in digital libraries or other sources. Pairwise classification is ...
- research-articleAugust 2019
Article quality classification on Wikipedia: introducing document embeddings and content features
OpenSym '19: Proceedings of the 15th International Symposium on Open CollaborationArticle No.: 13, Pages 1–8https://doi.org/10.1145/3306446.3340831The quality of articles on the Wikipedia platform is vital for its success. Currently, the assessment of quality is performed manually by the Wikipedia community, where editors classify articles into pre-defined quality classes. However, this approach ...
- short-paperJuly 2019
Block-distributed Gradient Boosted Trees
SIGIR'19: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information RetrievalPages 1025–1028https://doi.org/10.1145/3331184.3331331The Gradient Boosted Tree (GBT) algorithm is one of the most popular machine learning algorithms used in production, for tasks that include Click-Through Rate (CTR) prediction and learning-to-rank. To deal with the massive datasets available today, many ...
- research-articleAugust 2015
Probabilistic Modeling of a Sales Funnel to Prioritize Leads
KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data MiningPages 1751–1758https://doi.org/10.1145/2783258.2788578This paper shows how to learn probabilistic classifiers that model how sales prospects proceed through stages from first awareness to final success or failure. Specifically,we present two models, called DQM for direct qualification model and FFM for ...
- ArticleJune 2010
Learning to rank using an ensemble of lambda-gradient models
We describe the system that won Track 1 of the Yahoo! Learning to Rank Challenge.