XEWGraph : A tool for visualization and analysis of hypergraphs for a competitive intelligence system

Boulouard, Zakaria; Koutti, Lahcen; Haddadi, Anass El; Haddadi, Amine El; Fennan, Abdelhadi

doi:10.1109/isei.2015.7358726

Cited by 2 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Bat-Cluster algorithm will be integrated into XEWGraph [23], the large graph visualization service of the Competitive Intelligence tool Xplor EveryWhere [24]. Coupled with the out of the box categorization provided by XEWGraph"s hypergraph approach, BC will enable the user to have large graphs clustered and expanded on demand for both the web and the mobile oriented interfaces of XEWGraph.…”

Section: Resultsmentioning

confidence: 99%

Bat-Cluster: A Bat Algorithm-based Automated Graph Clustering Approach

Boulouard¹,

Haddadi²,

Bouhafer³

et al. 2018

IJECE

Self Cite

View full text Add to dashboard Cite

Defining the correct number of clusters is one of the most fundamental tasks in graph clustering. When it comes to large graphs, this task becomes more challenging because of the lack of prior information. This paper presents an approach to solve this problem based on the Bat Algorithm, one of the most promising swarm intelligence based algorithms. We chose to call our solution, "Bat-Cluster (BC)." This approach allows an automation of graph clustering based on a balance between global and local search processes. The simulation of four benchmark graphs of different sizes shows that our proposed algorithm is efficient and can provide higher precision and exceed some best-known values.

show abstract

Section: Resultsmentioning

confidence: 99%

Bat-Cluster: A Bat Algorithm-based Automated Graph Clustering Approach

Boulouard¹,

Haddadi²,

Bouhafer³

et al. 2018

IJECE

Self Cite

View full text Add to dashboard Cite

show abstract

“…The FFDP algorithm will be integrated into XEWGraph [26], the large graph visualization service of the Competitive Intelligence tool Xplor EveryWhere [27]. The out of the box clustering and categorization provided by XEWGraph's hypergraph approach will give us two advantages.…”

Section: Discussionmentioning

confidence: 99%

“Forced” Force Directed Placement: a New Algorithm for Large Graph Visualization

Boulouard

Koutti

Haddadi

et al. 2017

IRECOS

Self Cite

View full text Add to dashboard Cite

Graph Visualization is a technique that helps users to easily comprehend connected data (social networks, semantic networks, etc.) based on human perception. With the prevalence of Big Data, these graphs tend to be too large to decipher by the user's visual abilities alone. One of the leading causes of this problem is when the nodes leave the visualization space. Many attempts have been made to optimize large graph visualization, but they all have limitations. Among these attempts, the most famous one is the Force Directed Placement Algorithm. This algorithm can provide beautiful visualizations for small to medium graphs, but when it comes to larger graphs it fails to keep some independent nodes or even subgraphs inside the visualization space. In this paper, we present an algorithm that we have named "Forced Force Directed Placement". This algorithm provides an enhancement of the classical Force Directed Placement algorithm by proposing a stronger force function. The "FForce", as we have named it, can bring related nodes closer to each other before reaching an equilibrium position. This helped us gain more display space and that gave us the possibility to visualize larger graphs.

show abstract

XEWGraph : A tool for visualization and analysis of hypergraphs for a competitive intelligence system

Cited by 2 publications

References 5 publications

Bat-Cluster: A Bat Algorithm-based Automated Graph Clustering Approach

Bat-Cluster: A Bat Algorithm-based Automated Graph Clustering Approach

“Forced” Force Directed Placement: a New Algorithm for Large Graph Visualization

Contact Info

Product

Resources

About