Reducing the bottleneck of graph-based data mining by improving the efficiency of labeled graph isomorphism testing

Hsieh, Shu-Ming; Hsu, Cheng–Che; Ti, Yen‐Wu; Kuo, Chi-Jung

doi:10.1016/j.datak.2014.02.003

Cited by 3 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are a number of known graph representation tools that address different areas of problems. Saleh, Ratazzi and Xu (2017), the use of canonical code presented by Hsien, Hsu, Ti and Kuo (2014), weighted graphs node signature by Jouili and Tabbone (2009). etc.…”

Section: Overview Of Graph Signaturesmentioning

confidence: 99%

“…The canonical code can be defined by any feasible representation of the given tuple. Hsien, Hsu, Ti and Kuo (2014). In this case the canonical code is derived by concatenating some feasible features of the given node or tuple; which includes the state code(STid), local government code(LGid),Family code(FMid),Family generation level code(FGid), and the individual node's personal code(PSid).…”

Section: Graph Signaturementioning

confidence: 99%

See 1 more Smart Citation

Intelligent Citizenship Identity Through Family Pedigree Using Graph-Signature Based Random-Forest Model

Adeniyi¹,

Oladejo²,

Usman³

2021

FUOYEJET

View full text Add to dashboard Cite

There has been a global upsurge of interest in the topic of citizenship identity over the past decades, specifically in the world dominated by profound insecurity, inequalities, proliferation of identities, and rise of identity politics,engendered by capitalism. However finding effective solution to these problems has been rendered difficult. To alleviate these problems, this paper presents an analytical Machine learning model that suitably combined the graph signature with random forest techniques. This study presents the design and realization of a novel Intelligent Citizenship Identity through family pedigree using Graph Signature based random forest (GSB-RF) model. The study also showcases the development of a novel graph signature technique referred to as Canonical Code Signature(CCS) method. The CCS method is used at the pre-processing stage of the identification process to build signature for any given tuple. Performance comparisim between the present system and the baseline techniques which includes: the K-Nearest Neighbour and the traditional Random Forest shows that the present system outperformed the baseline method studied. The proposed system shows capability to perform continuous re-identification of Citizens based on their family pedigree with ability to select best sample with low computational complexity, high identification accuracy and speed. Our experimental result shows that the precision rate and identification quality of our system in most cases are equal to or greater than 70%. Therefore, the proposed Citizenship Identification machine is capable of providing usable, consistent, efficient, faster and accurate identification, to the users, security agents, government agents and institutions on-line, real-time and at any-time.Keywords- Canonical code,Citizenship Identity, Family pedigree,Graph-Signature,Machine learning, Random-forest

show abstract

Section: Overview Of Graph Signaturesmentioning

confidence: 99%

Section: Graph Signaturementioning

confidence: 99%