Saharnaz Dilmaghani

Saharnaz Dilmaghani

Auto-generated profile, based on publicly available information

Saharnaz Dilmaghani

University of Luxembourg

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2022 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SDSaharnaz Dilmaghani
Saharnaz Dilmaghani
MBMatthias Brust
Matthias Brust
CRCarlos H. C. Ribeiro
Carlos H. C. Ribeiro
EKEmmanuel Kieffer
Emmanuel Kieffer
GDGrégoire Danoy
Grégoire Danoy
PBPascal Bouvry
Pascal Bouvry
Identifying protein complexes in protein-protein interaction (ppi) networks is often handled as a community detection problem, with algorithms generally relying exclusively on the network topology for discovering a solution. The advancement of experimental techniques on ppi has motivated the generation of many Gene Ontology (go) databases. Incorporating the functionality extracted from go with the topological properties from the underlying ppi network yield a novel approach to identify protein complexes. Additionally, most of the existing algorithms use global measures that operate on the entire network to identify communities. The result of using global metrics are large communities that are often not correlated with the functionality of the proteins. Moreover, ppi network analysis shows that most of the biological functions possibly lie between local neighbours in ppi networks, which are not identifiable with global metrics. In this paper, we propose a local community detection algorithm, (lcda-go), that uniquely exploits information of functionality from go combined with the network topology. lcda-go identifies the community of each protein based on the topological and functional knowledge acquired solely from the local neighbour proteins within the ppi network. Experimental results using the Krogan dataset demonstrate that our algorithm outperforms in most cases state-of-the-art approaches in assessment based on Precision, Sensitivity, and particularly Composite Score. We also deployed lcda, the local-topology based precursor of lcda-go, to compare with a similar state-of-the-art approach that exclusively incorporates topological information of ppi networks for community detection. In addition to the high quality of the results, one main advantage of lcda-go is its low computational time complexity.

26 June 2019 in Frontiers in Big Data
Verified
Journal Article
Open access
PDF file
SDSaharnaz Dilmaghani
Saharnaz Dilmaghani
MBMatthias R. Brust
Matthias R. Brust
APApivadee Piyatumrong
Apivadee Piyatumrong
GDGrégoire Danoy
Grégoire Danoy
PBPascal Bouvry
Pascal Bouvry
Collaboration networks are defined as a set of individuals who come together and collaborate on particular tasks such as publishing a paper. The analysis of such networks permits to extract knowledge on the structure and patterns of communities. The link definition and network extraction have a high impact on the analysis of collaboration networks. Previous studies model the connectivity in a network considering it as a binomial problem with respect to the existence of a collaboration between individuals. However, such a data consists of a high diversity of features that describe the quality of the interaction such as the contribution amount of each individual. In this paper, we have determined a solution to extract collaboration networks using corresponding features in a dataset. We define collaboration score to quantify the collaboration between collaborators. In order to validate our proposed method, we benefit from a scientific research institute dataset in which researchers are co–authors who are involved in the production of papers, prototypes, and intellectual properties (IP). We evaluated the generated networks, produced through different thresholds of collaboration score, by employing a set of network analysis metrics such as clustering coefficient, network density, and centrality measures. We investigated more the obtained networks using a community detection algorithm to further discuss the impact of our model on community detection. The outcome shows that the quality of resulted communities on the extracted collaboration networks can differ significantly based on the choice of the linkage threshold.

5 April 2021
Verified
Book Chapter
Closed access
PDF file
SDSaharnaz Dilmaghani
Saharnaz Dilmaghani
MBMatthias R. Brust
Matthias R. Brust
GDGregoire Danoy
Gregoire Danoy
PBPascal Bouvry
Pascal Bouvry

20 December 2020
Verified
Book Chapter
Closed access
PDF file
SDSaharnaz Dilmaghani
Saharnaz Dilmaghani
MBMatthias R. Brust
Matthias R. Brust
GDGregoire Danoy
Gregoire Danoy
PBPascal Bouvry
Pascal Bouvry

16 December 2020
Verified
Book Chapter
Closed access
PDF file
SDSaharnaz Dilmaghani
Saharnaz Dilmaghani
APApivadee Piyatumrong
Apivadee Piyatumrong
GDGrégoire Danoy
Grégoire Danoy
PBPascal Bouvry
Pascal Bouvry
MBMatthias R. Brust
Matthias R. Brust

25 February 2019 in arXiv
Verified
Preprint
Open access
PDF file
SDSaharnaz E. Dilmaghani
Saharnaz E. Dilmaghani
APApivadee Piyatumrong
Apivadee Piyatumrong
Pascal BouvryPascal Bouvry
Pascal Bouvry
MBMatthias Brust
Matthias Brust
We consider the problem of automatically generating networks from data of collaborating researchers. The objective is to apply network analysis on the resulting network layers to reveal supplemental patterns and insights of the research collaborations. In this paper, we describe our data-to-networks method, which automatically generates a set of logical network layers from the relational input data using a linkage threshold. We, then, use a series of network metrics to analyze the impact of the linkage threshold on the individual network layers. Moreover, results from the network analysis also provide beneficial information to improve the network visualization. We demonstrate the feasibility and impact of our approach using real-world collaboration data. We discuss how the produced network layers can reveal insights and patterns to direct the data analytics more intelligently.