Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Ali Al-Bashabsheh"'
Publikováno v:
Entropy, Vol 26, Iss 3, p 268 (2024)
We address the challenge of identifying meaningful communities by proposing a model based on convex game theory and a measure of community strength. Many existing community detection methods fail to provide unique solutions, and it remains unclear ho
Externí odkaz:
https://doaj.org/article/669099df1c704f80836988ff1c4592e1
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9644ed7677237e1f4bbc9700c3b7797
https://doi.org/10.1109/isit50566.2022.9834751
https://doi.org/10.1109/isit50566.2022.9834751
Publikováno v:
IEEE Transactions on Information Theory. 67:2001-2011
We show that, under the info-clustering framework, correlated random variables can be clustered in an agglomerative manner. While the existing divisive approach successively segregates the random variables into subsets with increasing multivariate mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae655e498633ce8223d3fc6aef77bcce
https://doi.org/10.1109/tit.2020.3040492
https://doi.org/10.1109/tit.2020.3040492
Publikováno v:
ISIT
Estimating the mutual information (MI) by neural networks has achieved significant practical success, especially in representation learning. Recent results further reduced the variance in the neural estimation by training a probabilistic classifier.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16191b40591ba0b2b719e612edeeb5e1
https://doi.org/10.1109/isit45174.2021.9518097
https://doi.org/10.1109/isit45174.2021.9518097
Publikováno v:
IEEE Transactions on Information Theory. 65:1493-1511
Let $X_i, i \in V$ form a Markov random field (MRF) represented by an undirected graph $G = (V,E)$, and $V'$ be a subset of $V$. We determine the smallest graph that can always represent the subfield $X_i, i \in V'$ as an MRF. Based on this result, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::32677100d9ded684f018a18ed79fe8fa
https://doi.org/10.1109/tit.2018.2866564
https://doi.org/10.1109/tit.2018.2866564
Publikováno v:
AAAI
We consider the problem of learning a neural network classifier. Under the information bottleneck (IB) principle, we associate with this classification problem a representation learning problem, which we call "IB learning". We show that IB learning i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9904852604e597fa2d22e97fd459c052
https://nrc-publications.canada.ca/eng/view/object/?id=fea97c89-ad6b-4696-8a2f-147e402bcf38
https://nrc-publications.canada.ca/eng/view/object/?id=fea97c89-ad6b-4696-8a2f-147e402bcf38
Publikováno v:
IEEE Transactions on Information Theory. 64:57-76
We study the change of multivariate mutual information among a set of random variables when some common randomness is added to or removed from a subset of the random variables. This is formulated more precisely as two new multiterminal secret key agr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87d70f4e4b8fb24a02b5901598caabec
https://doi.org/10.1109/tit.2017.2749372
https://doi.org/10.1109/tit.2017.2749372
Autor:
Abbas Yongacoglu, Ali Al-Bashabsheh
Publikováno v:
EURASIP Journal on Wireless Communications and Networking, Vol 2008 (2008)
We characterize the average linear network coding throughput, Tc avg, for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving TcâÂ
Externí odkaz:
https://doaj.org/article/f2e449f9ab9c487a8f73a4b02acac13b
Publikováno v:
ISIT
We consider the web community detection problem by providing a cost function that, not only penalizes external connections, but also rewards the internal ones. Our formulation addresses limitations of cut-clustering and extends web communities to dig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::055afd8f575ecdbf1d23e7f376643999
Publikováno v:
IEEE Transactions on Information Theory. 62:3270-3289
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e338ff1ecf0a76bb9c3f8456c5d134cb
https://doi.org/10.1109/tit.2016.2555923
https://doi.org/10.1109/tit.2016.2555923