Speeding Up Bipartite Graph Visualization Method

2011 ◽  
pp. 697-706 ◽  
Author(s):  
Takayasu Fushimi ◽  
Yamato Kubota ◽  
Kazumi Saito ◽  
Masahiro Kimura ◽  
Kouzou Ohara ◽  
...  
Keyword(s):  
Bipartite Graph ◽  
Graph Visualization ◽  
Visualization Method

scholarly journals Semi-bipartite Graph Visualization for Gene Ontology Networks

2010 ◽  
pp. 244-255 ◽  
Author(s):  
Kai Xu ◽  
Rohan Williams ◽  
Seok-Hee Hong ◽  
Qing Liu ◽  
Ji Zhang
Keyword(s):  
Gene Ontology ◽  
Bipartite Graph ◽  
Graph Visualization

Sierra: A bipartite graph visualization

2017 ◽  
Author(s):  
Armando Arce-Orozco ◽  
Oscar Arrieta-Rodriguez ◽  
Jason Ocampo-Solis
Keyword(s):  
Bipartite Graph ◽  
Graph Visualization

scholarly journals Combining the Attribute Oriented Induction and Graph Visualization to Enhancement Association Rules Interpretation

2016 ◽  
Vol 42 (1) ◽  
pp. 10-22
Author(s):  
Safaa Al-Mamory ◽  
Zahraa Abdullah
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Graph Visualization ◽  
Visualization Method ◽  
Huge Number ◽  
Graph Method ◽  
Drill Down

The important methods of data mining is large and from these methods is mining of association rule. The miningof association rule gives huge number of the rules. These huge rules make analyst consuming more time when searchingthrough the large rules for finding the interesting rules. One of the solutions for this problem is combing between one of theAssociation rules visualization method and generalization method. Association rules visualization method is graph-basedmethod. Generalization method is Attribute Oriented Induction algorithm (AOI). AOI after combing calls ModifiedAOI because it removes and changes in the steps of the traditional AOI. The graph technique after combing also callsgrouped graph method because it displays the aggregated that results rules from AOI. The results of this paper are ratio ofcompression that gives clarity of visualization. These results provide the ability for test and drill down in the rules orunderstand and roll up.

Alertwheel: radial bipartite graph visualization applied to intrusion detection system alerts

IEEE Network ◽  
2012 ◽  
Vol 26 (6) ◽  
pp. 12-18 ◽  
Author(s):  
Maxime Dumas ◽  
Jean-Marc Robert ◽  
Michael J. Mcguffin
Keyword(s):  
Intrusion Detection ◽  
Bipartite Graph ◽  
Intrusion Detection System ◽  
Detection System ◽  
Graph Visualization

EXPERIMENTAL STUDY OF NATURAL CONVECTION IN A CAVITY: PRECISE VISUALIZATION METHOD OF TEMPERATURE FIELD

2018 ◽  
Author(s):  
Menghua Duan ◽  
Lin Chen ◽  
Yongchang Feng ◽  
Junnosuke Okajima ◽  
Atsuki Komiya
Keyword(s):  
Experimental Study ◽  
Temperature Field ◽  
Natural Convection ◽  
Visualization Method

Concept of a visualization method for earth�s gravity field on plain maps

2019 ◽  
Vol 11 (1) ◽  
Author(s):  
M.A. Boyarchuk ◽  
I.G. Zhurkin ◽  
V.B. Nepoklonov
Keyword(s):  
Gravity Field ◽  
Visualization Method

Graceful Labeling for Some Complete Bipartite Graph

2018 ◽  
Vol 9 (12) ◽  
pp. 2147-2152
Author(s):  
V. Raju ◽  
M. Paruvatha vathana
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Graceful Labeling

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

Sign in / Sign up

Export Citation Format

Share Document