3 citations · 5 across the 6 of their papers we have counts for
7 papers
Detecting individual-level infections using sparse group-testing through graph-coupled hidden Markov models
Zahra Gholamalian, Zeinab Maleki, MasoudReza Hashemi +1
Identifying the infection status of each individual during infectious diseases informs public health management. However, performing frequent individual-level tests may not be feas…
Equilibration Analysis and Control of Coordinating Decision-Making Populations
Negar Sakhaei, Zeinab Maleki, Pouria Ramazi
Whether a population of decision-making individuals will reach a state of satisfactory decisions is a fundamental problem in studying collective behaviors. In the framework of evol…
Evaluating Sparse Interpretable Word Embeddings for Biomedical Domain
Mohammad Amin Samadi, Mohammad Sadegh Akhondzadeh, Sayed Jalal Zahabi +3
Word embeddings have found their way into a wide range of natural language processing tasks including those in the biomedical domain. While these vector representations successfull…
DHLP 1&2: Giraph based distributed label propagation algorithms on heterogeneous drug-related networks
Erfan Farhangi Maleki, Nasser Ghadiri, Maryam Lotfi Shahreza +1
Background and Objective: Heterogeneous complex networks are large graphs consisting of different types of nodes and edges. The knowledge extraction from these networks is complica…
The minimum number of triangular edges and a symmetrization method for multiple graphs
Zoltán Füredi, Zeinab Maleki
We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetri…
Some lower bounds for the -intersection number of graphs
Zeinab Maleki, Behnaz Omoomi
For a set of non-negative integers , the -intersection number of a graph is the smallest number for which there is an assignment on the vertices to subsets $A_v \subseteq…
Local Clique Covering of Graphs
Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-cliq…