Probabilistic Relational Connectivity Analysis of Bigram Models

dc.authoridAlagoz, Baris Baykant/0000-0001-5238-6433
dc.authoridAlnahas, Dima/0000-0002-6046-1066
dc.authorwosidAlagoz, Baris Baykant/ABG-8526-2020
dc.contributor.authorAlnahas, Dima
dc.contributor.authorAlagoz, Bans Baykant
dc.date.accessioned2024-08-04T20:46:54Z
dc.date.available2024-08-04T20:46:54Z
dc.date.issued2019
dc.departmentİnönü Üniversitesien_US
dc.descriptionInternational Conference on Artificial Intelligence and Data Processing (IDAP) -- SEP 21-22, 2019 -- Inonu Univ, Malatya, TURKEYen_US
dc.description.abstractThis 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.sponsorshipIEEE Turkey Sect,Anatolian Sci,Inonu Univ, Comp Sci Dept,Inonu Univ, Muhendisli Fakultesien_US
dc.identifier.doi10.1109/idap.2019.8875980
dc.identifier.scopus2-s2.0-85074879160en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://doi.org/10.1109/idap.2019.8875980
dc.identifier.urihttps://hdl.handle.net/11616/99028
dc.identifier.wosWOS:000591781100107en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIeeeen_US
dc.relation.ispartof2019 International Conference on Artificial Intelligence and Data Processing (Idap 2019)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectSemantic networken_US
dc.subjecttransitivityen_US
dc.subjectgraph connectivityen_US
dc.subjectbigram co-occurrence probabilityen_US
dc.subjecttext comparisonen_US
dc.titleProbabilistic Relational Connectivity Analysis of Bigram Modelsen_US
dc.typeConference Objecten_US

Dosyalar