Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Mieczyslaw A. Klopotek"'
Publikováno v:
Intelligent Systems in Industrial Applications ISBN: 9783030671471
ISMIS (Industrial Paper)
ISMIS (Industrial Paper)
It is a known phenomenon that text document classifiers may benefit from inclusion of hypernyms of the terms in the document. However, this inclusion may be a mixed blessing because it may fuzzify the boundaries between document classes [5, 6, 10].
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29e6b6677fe5afd03e7a271167759ee6
https://doi.org/10.1007/978-3-030-67148-8_6
https://doi.org/10.1007/978-3-030-67148-8_6
Publikováno v:
Artificial Intelligence and Soft Computing ISBN: 9783030614003
ICAISC (1)
ICAISC (1)
We propose a new document classification method, bridging discrepancies (so-called semantic gap) between the training set and the application sets of textual data. We demonstrate its superiority over classical text classification approaches, includin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55c83344dfb1c1fb82f67c00359a4ece
https://doi.org/10.1007/978-3-030-61401-0_61
https://doi.org/10.1007/978-3-030-61401-0_61
Publikováno v:
Fundamenta Informaticae. 139:229-248
Latency of user-based and item-based recommenders is evaluated. The two algorithms can deliver high quality predictions in dynamically changing environments. However, their response time depends not only on the size, but also on the structure of unde
Autor:
Barbara Gałusza, Mieczyslaw A. Klopotek, Kornel Szczygielski, Piotr Rapiejko, Dariusz Jurkiewicz
Publikováno v:
Acta oto-laryngologica. 137(9)
The balloon catheter has been used for a decade to dilate paranasal sinus outflow tracts. The question is: how wide and how durable is the dilation of drainage pathways in patients in long-term observations after this procedure?The objective of our s
Publikováno v:
Annals of computer science and information systems, Vol 8, Pp 533-540 (2016)
FedCSIS
FedCSIS
Pattern-based methods of IS-A relation extraction rely heavily on so called Hearst patterns. These are ways of expressing instance enumerations of a class in natural language. While these lexico-syntactic patterns prove quite useful, they may not cap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92e2ebf3c218e29cb28b9af10a9d5c57
http://arxiv.org/abs/1605.02916
http://arxiv.org/abs/1605.02916
Autor:
Dariusz Czerski, Krzysztof Ciesielski, Michał Dramiński, Mieczyslaw A. Klopotek, Slawomir T. Wierzchon
Publikováno v:
WI-IAT (2)
In this paper a reflection on the relationships among random-walk-with-back step, lazy walk and traditional Page Rank is made. It is demonstrated that though all of them differ semantically, they still can be computed using the very same algorithm.
Autor:
Mieczyslaw A. Klopotek
Publikováno v:
Future Generation Computer Systems. 21:1068-1082
This paper presents a newly developed algorithm learning very large tree-like Bayesian networks from data and exploits it to create a Bayesian multinet (BMN) classifier for natural language text documents. Results of empirical evaluation of this BMN
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319083254
ISMIS
ISMIS
We present a novel algorithm of document categorization, assigning multiple labels out of a large set of hierarchically arranged (but not necessarily tree-like) set of possible categories. It extends our Wikipedia-based method presented in [1] via un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2feb4e8088f58dc556ed382ab32b09f0
https://doi.org/10.1007/978-3-319-08326-1_34
https://doi.org/10.1007/978-3-319-08326-1_34
Publikováno v:
2013 Second International Conference on Informatics & Applications (ICIA).
This paper proposes application of Formal Concept Analysis (FCA) in creating character-level information extraction patterns and presents BigGrams: a prototype of a language-independent information extraction system. The main goal of the system is to
Publikováno v:
Fundamenta Informaticae. 30:359-371
In the literature, the optimization problem to identify a set of composite hypotheses H, which will yield the k largest P(H|S e) where a composite hypothesis is an instantiation of all the nodes in the network except the evidence nodes [17] is of sig