Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Aydin Gerek"'
Publikováno v:
Intelligent and Fuzzy Techniques in Big Data Analytics and Decision Making ISBN: 9783030237554
Inherent clusters formed by observations used for the training of a classification model is a frequently encountered case. These clusters differ in certain characteristics, however in classical modelling techniques no information on these differences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed05214c4f6cf7f7f8ac093098e6b80e
https://doi.org/10.1007/978-3-030-23756-1_43
https://doi.org/10.1007/978-3-030-23756-1_43
Publikováno v:
INISTA
Natural language processing (NLP) is an important field of Artificial Intelligence. One of the fundamental problems in NLP is to create vector (distributed) representations of words so that vectors of words that have similar meaning lie closer in spa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d7b69e236ae50f4058bc187f7194e5f
https://doi.org/10.1109/inista.2019.8778304
https://doi.org/10.1109/inista.2019.8778304
Diffused Label Propagation based Transductive Classification Algorithm for Word Sense Disambiguation
Publikováno v:
INISTA
A major natural language processing problem, word sense disambiguation is the task of identifying the correct sense of a polysemous word based on its context. In terms of machine learning, this can be considered as a supervised classification problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4319901c860d79a8ef0d742a423e27a5
https://doi.org/10.1109/inista.2019.8778218
https://doi.org/10.1109/inista.2019.8778218
Publikováno v:
Natural Language Processing and Information Systems ISBN: 9783030232801
NLDB
NLDB
The word2vec and fastText models train two vectors per word: a word and a context vector. Typically the context vectors are discarded after training, even though they may contain useful information for different NLP tasks. Therefore we combine word a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26f3fe5d4374d269fdb703eb15b796fc
https://aperta.ulakbim.gov.tr/record/68991
https://aperta.ulakbim.gov.tr/record/68991
Publikováno v:
Journal of Combinatorics. 3:683-693
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62540f1339fbbe3486066b3cee6c831f
https://doi.org/10.4310/joc.2012.v3.n4.a6
https://doi.org/10.4310/joc.2012.v3.n4.a6
Publikováno v:
Pacific Journal of Mathematics. 231:63-84
We obtain the isoperimetric profile for the standard initial slices in the Reissner‐Nordstrom and Schwarzschild anti-de Sitter spacetimes, following recent work of Bray and Morgan on isoperimetric comparison. We then discuss these results in the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39e52400fada8be9d93be55c014f5f7f
https://doi.org/10.2140/pjm.2007.231.63
https://doi.org/10.2140/pjm.2007.231.63
Publikováno v:
The Electronic Journal of Combinatorics. 14
Let $F_4$ be the root system associated with the 24-cell, and let $M(F_4)$ be the simple linear dependence matroid corresponding to this root system. We determine the automorphism group of this matroid and compare it to the Coxeter group $W$ for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8581fa70eb44dc9048ad047dd7661ac
https://doi.org/10.37236/996
https://doi.org/10.37236/996
Autor:
Zsolt Tuza, Leandro Montero, Valentin Borozan, Yannis Manoussakis, Colton Magnant, Shinya Fujita, Aydin Gerek
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2012, 312 (17), pp.Pages 2550-2560. ⟨10.1016/j.disc.2011.09.003⟩
Discrete Mathematics, 2012, 312 (17), pp.Pages 2550-2560. ⟨10.1016/j.disc.2011.09.003⟩
Discrete Mathematics, Elsevier, 2012, 312 (17), pp.Pages 2550-2560. ⟨10.1016/j.disc.2011.09.003⟩
Discrete Mathematics, 2012, 312 (17), pp.Pages 2550-2560. ⟨10.1016/j.disc.2011.09.003⟩
An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The k-proper connection number of a connected graph G, denoted by pck(G), is the smallest number of co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03efbae8a4b8a22c8cbe42ca00cf6e83