Probabilistic Relational Connectivity Analysis of Bigram Models
dc.authorid | Alagoz, Baris Baykant/0000-0001-5238-6433 | |
dc.authorid | Alnahas, Dima/0000-0002-6046-1066 | |
dc.authorwosid | Alagoz, Baris Baykant/ABG-8526-2020 | |
dc.contributor.author | Alnahas, Dima | |
dc.contributor.author | Alagoz, Bans Baykant | |
dc.date.accessioned | 2024-08-04T20:46:54Z | |
dc.date.available | 2024-08-04T20:46:54Z | |
dc.date.issued | 2019 | |
dc.department | İnönü Üniversitesi | en_US |
dc.description | International Conference on Artificial Intelligence and Data Processing (IDAP) -- SEP 21-22, 2019 -- Inonu Univ, Malatya, TURKEY | en_US |
dc.description.abstract | This study demonstrates an application of probabilistic relational graph connectivity analysis in bigram models (2-gram) of texts. The probabilistic relation matrices are calculated by estimating bigram co-occurrence probabilities in word sequence of a given short text. Then, deeper probabilistic connectivity relations among word sequences can be considered by calculating powers of probabilistic relation matrix of bigram models. Cosine similarity measure is used to evaluate similarity of probabilistic connectivity patterns of lexemes in a given message. Illustrative analysis examples are presented to discuss results of sentence-wise and short text analyses. | en_US |
dc.description.sponsorship | IEEE Turkey Sect,Anatolian Sci,Inonu Univ, Comp Sci Dept,Inonu Univ, Muhendisli Fakultesi | en_US |
dc.identifier.doi | 10.1109/idap.2019.8875980 | |
dc.identifier.scopus | 2-s2.0-85074879160 | en_US |
dc.identifier.scopusquality | N/A | en_US |
dc.identifier.uri | https://doi.org/10.1109/idap.2019.8875980 | |
dc.identifier.uri | https://hdl.handle.net/11616/99028 | |
dc.identifier.wos | WOS:000591781100107 | en_US |
dc.identifier.wosquality | N/A | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Ieee | en_US |
dc.relation.ispartof | 2019 International Conference on Artificial Intelligence and Data Processing (Idap 2019) | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Semantic network | en_US |
dc.subject | transitivity | en_US |
dc.subject | graph connectivity | en_US |
dc.subject | bigram co-occurrence probability | en_US |
dc.subject | text comparison | en_US |
dc.title | Probabilistic Relational Connectivity Analysis of Bigram Models | en_US |
dc.type | Conference Object | en_US |