Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bruno Golenia"'
Autor:
Simon Price, Bruno Golenia, Sebastian Spiegler, John Guiver, Peter A. Flach, Mohammed J. Zaki, Thore Graepel, Ralf Herbrich
Publikováno v:
ACM SIGKDD Explorations Newsletter. 11:63-67
The SIGKDD'09 Research Track received 537 paper submissions, which were reviewed by a Program Committee of 199 members, and a Senior Program Committee of 22 members. We used techniques from artificial intelligence and data mining to streamline and su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a791846be7d5508981f90620c745817e
https://doi.org/10.1145/1809400.1809413
https://doi.org/10.1145/1809400.1809413
Publikováno v:
IEEE Transactions on Audio, Speech, and Language Processing. 17:956-965
In this paper, we describe a novel and effective approach for automatically decomposing a word into stem and suffixes. Russian and Turkish are used as exemplars of fusional and agglutinating languages. Rather than relying on corpus counts, we use a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1461ddb2f6ba4df1e9bbcab7090235c
https://doi.org/10.1109/tasl.2009.2015694
https://doi.org/10.1109/tasl.2009.2015694
Publikováno v:
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, Open Journal Systems, 2012, pp.Volume 19, Issue 4
The Electronic Journal of Combinatorics, Open Journal Systems, 2012, pp.Volume 19, Issue 4
The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011, DeMaio and Mathew provide an extension of this result for 3-dimensional rectangular boards. In this article, we give the so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3a98fc34f73c3e825544d6e9f4aee6e
https://hal.archives-ouvertes.fr/hal-00673397v3/document
https://hal.archives-ouvertes.fr/hal-00673397v3/document
Publikováno v:
Decision Support Systems Advances in
Nowadays the internet is an essential tool for the exchange of information on a personal and professional level. The web offers us a world of prodigious information and has evolved from simple sets of static information to services which are more and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4c38a4fc1d95bafa76e8388cacdeb77
http://www.intechopen.com/articles/show/title/towards-an-optimal-decision-support-system
http://www.intechopen.com/articles/show/title/towards-an-optimal-decision-support-system
Publikováno v:
SLT
In this paper we compare different levels of supervision for learning the morphology of the indigenous South African language Zulu. After a preliminary analysis of the Zulu data used for our experiments, we concentrate on supervised, semi-supervised
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7722fa8c2c0f6136d8ce291821b68c50
https://doi.org/10.1109/slt.2008.4777827
https://doi.org/10.1109/slt.2008.4777827
Publikováno v:
University of Bristol-PURE
Lecture Notes in Computer Science ISBN: 9783642157530
CLEF (1)
Lecture Notes in Computer Science ISBN: 9783642157530
CLEF (1)
In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be applied to languages whose words have the structure prefixes-stem-suffixes. In the f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd58e7c06129e40d2f593589339c4eb1
https://research-information.bris.ac.uk/en/publications/7d5cffff-504a-4c02-be66-6ea64b0a1e13
https://research-information.bris.ac.uk/en/publications/7d5cffff-504a-4c02-be66-6ea64b0a1e13
Publikováno v:
University of Bristol-PURE
Lecture Notes in Computer Science ISBN: 9783642157530
CLEF (1)
Lecture Notes in Computer Science ISBN: 9783642157530
CLEF (1)
We present PROMODES an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variables and includes probabilities for letter transitions within segments. Fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fb08fdaf78797cc147fb482a9deba5f
https://research-information.bris.ac.uk/en/publications/2af66f7c-61bc-427f-b72d-05a4e10f7c21
https://research-information.bris.ac.uk/en/publications/2af66f7c-61bc-427f-b72d-05a4e10f7c21