A distributed approach to weighted frequent Subgraph mining

In various application domains like Social Network Analysis, cheminformatics etc, graph based data representations are used to effectively represent the complex relationships among entities. Many graph mining approaches have been developed over the years; of which one of the most challenging tasks i...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2016 International Conference on Emerging Technological Trends (ICETT) s. 1 - 7
Hlavní autori: Babu, Nisha, John, Ansamma
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.10.2016
Predmet:
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In various application domains like Social Network Analysis, cheminformatics etc, graph based data representations are used to effectively represent the complex relationships among entities. Many graph mining approaches have been developed over the years; of which one of the most challenging tasks is frequent subgraph mining (FSM). Most of the existing FSM algorithms consider only the graph-based structure, the importance of entities involved or the strength of their relationships are not considered. Weighted graphs may be better suited for many cases such as social networks, mobile-communication networks, transportation networks etc. Thus there is a need for efficient weighted subgraph mining approaches. Only few methods have been developed for FSM in weighted graphs. In the present big data era, to handle the massive quantity of data generated from various applications, there is a huge demand for distributed computational approaches. Currently, there is no such distributed approach for weighted FSM. In this work, a distributed approach for weighted frequent subgraph mining using MapReduce framework (WFSM-MR) is proposed. The idea is that both data and the computation part, i.e. weighted subgraph mining, should be distributed for efficient processing. The method is used to discover the significant weighted frequent subgraphs from various edge-weighted graph datasets. Experimental results indicate the proposed approach is efficient, scalable, and can handle large graph datasets compared to the existing non distributed weighted FSM task.
AbstractList In various application domains like Social Network Analysis, cheminformatics etc, graph based data representations are used to effectively represent the complex relationships among entities. Many graph mining approaches have been developed over the years; of which one of the most challenging tasks is frequent subgraph mining (FSM). Most of the existing FSM algorithms consider only the graph-based structure, the importance of entities involved or the strength of their relationships are not considered. Weighted graphs may be better suited for many cases such as social networks, mobile-communication networks, transportation networks etc. Thus there is a need for efficient weighted subgraph mining approaches. Only few methods have been developed for FSM in weighted graphs. In the present big data era, to handle the massive quantity of data generated from various applications, there is a huge demand for distributed computational approaches. Currently, there is no such distributed approach for weighted FSM. In this work, a distributed approach for weighted frequent subgraph mining using MapReduce framework (WFSM-MR) is proposed. The idea is that both data and the computation part, i.e. weighted subgraph mining, should be distributed for efficient processing. The method is used to discover the significant weighted frequent subgraphs from various edge-weighted graph datasets. Experimental results indicate the proposed approach is efficient, scalable, and can handle large graph datasets compared to the existing non distributed weighted FSM task.
Author Babu, Nisha
John, Ansamma
Author_xml – sequence: 1
  givenname: Nisha
  surname: Babu
  fullname: Babu, Nisha
  email: nishababu6@gmail.com
  organization: Dept. of Comput. Sci. & Eng, TKM Coll. of Eng., Kollam, India
– sequence: 2
  givenname: Ansamma
  surname: John
  fullname: John, Ansamma
  email: ansamma.john@gmail.com
  organization: Dept. of Comput. Sci. & Eng, TKM Coll. of Eng., Kollam, India
BookMark eNotj8tKxDAUQCPowhn9Ad3kB1qT3jwmuBrKqAMDLux-yOO2DThpzaSIfy_irA6cxYGzItdpSkjIA2c158w87dtd19UN46rWGw2aySuy4pIZBlpyc0uetzTEc8nRLQUDtfOcJ-tHWib6jXEY_2Sf8WvBVOjH4oZs55GeYoppuCM3vf084_2Fa9K97Lr2rTq8v-7b7aGKhpUq8CAEb7xV2lsfjPNCgQIRnESlQEPjwEqtlXPMbFCKRjAvOSjvNWLvYE0e_7MREY9zjiebf46XHfgF7i5Eog
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICETT.2016.7873705
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1509037519
9781509037513
EndPage 7
ExternalDocumentID 7873705
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-d1d4412ca67cacd9bc463634db5e663732b3a5776bb098e54240c5136cc7eefb3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:37:48 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-d1d4412ca67cacd9bc463634db5e663732b3a5776bb098e54240c5136cc7eefb3
PageCount 7
ParticipantIDs ieee_primary_7873705
PublicationCentury 2000
PublicationDate 2016-Oct.
PublicationDateYYYYMMDD 2016-10-01
PublicationDate_xml – month: 10
  year: 2016
  text: 2016-Oct.
PublicationDecade 2010
PublicationTitle 2016 International Conference on Emerging Technological Trends (ICETT)
PublicationTitleAbbrev ICETT
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.6473926
Snippet In various application domains like Social Network Analysis, cheminformatics etc, graph based data representations are used to effectively represent the...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Algorithm design and analysis
Data mining
Data structures
Distributed databases
distributed graph algorithm
frequent subgraph mining
MapReduce framework
Social network services
Transportation
weighted subgraph
Title A distributed approach to weighted frequent Subgraph mining
URI https://ieeexplore.ieee.org/document/7873705
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8eBJpRXf5ODRtNvNa4MnKS16KT3sobeSxyz04FbqVv--SbatCF68hSEQJq8Zkm--D-ChMFhIxS01FdeU8yqnxhhBLZNVZrhlQtskNqFms2Kx0PMOPB5qYRAxgc9wEJvpL9-v3TY-lQ3D5mIqEpYeKSXbWq19HUymh6_jSVlGsJYc7Dr-UkxJAWN6-r-hzqD_U3lH5oeYcg4drHvw9Ex85LeN0lToyZ4GnDRr8pVeNoOx2iRMdEPCTZBIqMlbkn7oQzmdlOMXuhM9oCudNdSPfEhQcmekcsZ5bV1k9GLcW4EhOVAst8yI4L61mS5Q8BCRnRgx6ZxCrCy7gG69rvESiGXeh-QtDyeQc2_ywjEpjRpxNEoj5lfQi34v31tai-XO5eu_zTdwEqe2xbHdQrfZbPEOjt1ns_rY3Ke1-AajW42B
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JS0MxEA6lCnpSacXdHDya9jXrC56ktLRYSw_v0FvJMg96sJX6qn_fJF1E8OItDIEw2WZIvvk-hB5yA7lU3BJTck04LykxxghimSwzwy0T2iaxCTUe59OpntTQ474WBgAS-AxasZn-8v3SreNTWTtsLqYiYemB4Jxmm2qtXSVMptvDbq8oIlxLtrZdf2mmpJDRP_nfYKeo-VN7hyf7qHKGarBooKdn7CPDbRSnAo93ROC4WuKv9LYZjOUqoaIrHO6CREON35L4QxMV_V7RHZCt7AGZ66wivuNDikKdkcoZ57V1kdOLcW8FhPRAMWqZEUpJazOdg-AhJjvRYdI5BVBado7qi-UCLhC2zPuQvtFwBjn3huaOSWlUh4NRGoBeokb0e_a-IbaYbV2--tt8j44GxetoNhqOX67RcZzmDartBtWr1Rpu0aH7rOYfq7u0Lt8w25DI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2016+International+Conference+on+Emerging+Technological+Trends+%28ICETT%29&rft.atitle=A+distributed+approach+to+weighted+frequent+Subgraph+mining&rft.au=Babu%2C+Nisha&rft.au=John%2C+Ansamma&rft.date=2016-10-01&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FICETT.2016.7873705&rft.externalDocID=7873705