TU Darmstadt / ULB / TUbiblio

Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain

Loza Mencía, Eneldo ; Fürnkranz, Johannes
Hrsg.: Francesconi, Enrico ; Montemagni, Simonetta ; Peters, Wim ; Tiscornia, Daniela (2010)
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain.
In: Semantic Processing of Legal Texts -- Where the Language of Law Meets the Law of Language
doi: 10.1007/978-3-642-12837-0_11
Buchkapitel, Bibliographie

Kurzbeschreibung (Abstract)

In this paper we apply multilabel classification algorithms to the EUR-Lex database of legal documents of the European Union. For this document collection, we studied three different multilabel classification problems, the largest being the categorization into the EUROVOC concept hierarchy with almost 4000 classes. We evaluated three algorithms: (i) the binary relevance approach which independently trains one classifier per label; (ii) the multiclass multilabel perceptron algorithm, which respects dependencies between the base classifiers; and (iii) the multilabel pairwise perceptron algorithm, which trains one classifier for each pair of labels. All algorithms use the simple but very efficient perceptron algorithm as the underlying classifier, which makes them very suitable for large-scale multilabel classification problems. The main challenge we had to face was that the almost 8,000,000 perceptrons that had to be trained in the pairwise setting could no longer be stored in memory. We solve this problem by resorting to the dual representation of the perceptron, which makes the pairwise approach feasible for problems of this size. The results on the EUR-Lex database confirm the good predictive performance of the pairwise approach and demonstrates the feasibility of this approach for large-scale tasks.

Typ des Eintrags: Buchkapitel
Erschienen: 2010
Herausgeber: Francesconi, Enrico ; Montemagni, Simonetta ; Peters, Wim ; Tiscornia, Daniela
Autor(en): Loza Mencía, Eneldo ; Fürnkranz, Johannes
Art des Eintrags: Bibliographie
Titel: Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
Sprache: Englisch
Publikationsjahr: 2010
Verlag: Springer-Verlag
Buchtitel: Semantic Processing of Legal Texts -- Where the Language of Law Meets the Law of Language
Band einer Reihe: 6036
DOI: 10.1007/978-3-642-12837-0_11
Kurzbeschreibung (Abstract):

In this paper we apply multilabel classification algorithms to the EUR-Lex database of legal documents of the European Union. For this document collection, we studied three different multilabel classification problems, the largest being the categorization into the EUROVOC concept hierarchy with almost 4000 classes. We evaluated three algorithms: (i) the binary relevance approach which independently trains one classifier per label; (ii) the multiclass multilabel perceptron algorithm, which respects dependencies between the base classifiers; and (iii) the multilabel pairwise perceptron algorithm, which trains one classifier for each pair of labels. All algorithms use the simple but very efficient perceptron algorithm as the underlying classifier, which makes them very suitable for large-scale multilabel classification problems. The main challenge we had to face was that the almost 8,000,000 perceptrons that had to be trained in the pairwise setting could no longer be stored in memory. We solve this problem by resorting to the dual representation of the perceptron, which makes the pairwise approach feasible for problems of this size. The results on the EUR-Lex database confirm the good predictive performance of the pairwise approach and demonstrates the feasibility of this approach for large-scale tasks.

Freie Schlagworte: EUR-Lex Database, learning by pairwise comparison, Legal Documents, multilabel classification, Text Classification
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik > Knowledge Engineering
20 Fachbereich Informatik
Hinterlegungsdatum: 24 Jun 2011 14:22
Letzte Änderung: 05 Mär 2013 09:49
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen