License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SLATE.2016.1
URN: urn:nbn:de:0030-drops-60062
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6006/
Go to the corresponding OASIcs Volume Portal


Škvorc, Tadej ; Lavrač, Nada ; Robnik-Šikonja, Marko

Co-Bidding Graphs for Constrained Paper Clustering

pdf-format:
OASIcs-SLATE-2016-1.pdf (0.7 MB)


Abstract

The information for many important problems can be found in various formats and modalities. Besides standard tabular form, these include also text and graphs. To solve such problems fusion of different data sources is required. We demonstrate a methodology which is capable to enrich textual information with graph based data and utilize both in an innovative machine learning application of clustering. The proposed solution is helpful in organization of academic conferences and automates one of its time consuming tasks. Conference organizers can currently use a small number of software tools that allow managing of the paper review process with no/little support for automated conference scheduling. We present a two-tier constrained clustering method for automatic conference scheduling that can automatically assign paper presentations into predefined schedule slots instead of requiring the program chairs to assign them manually. The method uses clustering algorithms to group papers into clusters based on similarities between papers. We use two types of similarities: text similarities (paper similarity with respect to their abstract and title), together with graph similarity based on reviewers' co-bidding information collected during the conference reviewing phase. In this way reviewers' preferences serve as a proxy for preferences of conference attendees. As a result of the proposed two-tier clustering process similar papers are assigned to predefined conference schedule slots. We show that using graph based information in addition to text based similarity increases clustering performance. The source code of the solution is freely available.

BibTeX - Entry

@InProceedings{kvorc_et_al:OASIcs:2016:6006,
  author =	{Tadej {\v{S}}kvorc and Nada Lavrač and Marko Robnik-{\v{S}}ikonja},
  title =	{{Co-Bidding Graphs for Constrained Paper Clustering}},
  booktitle =	{5th Symposium on Languages, Applications and Technologies (SLATE'16)},
  pages =	{1:1--1:13},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-006-4},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{51},
  editor =	{Marjan Mernik and Jos{\'e} Paulo Leal and Hugo Gon{\c{c}}alo Oliveira},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6006},
  URN =		{urn:nbn:de:0030-drops-60062},
  doi =		{10.4230/OASIcs.SLATE.2016.1},
  annote =	{Keywords: Text mining, data fusion, scheduling, constrained clustering, conference}
}

Keywords: Text mining, data fusion, scheduling, constrained clustering, conference
Collection: 5th Symposium on Languages, Applications and Technologies (SLATE'16)
Issue Date: 2016
Date of publication: 21.06.2016


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI