{"id":"https://openalex.org/W2061830134","doi":"https://doi.org/10.1145/1142473.1142570","title":"VGM","display_name":"VGM","publication_year":2006,"publication_date":"2006-06-27","ids":{"openalex":"https://openalex.org/W2061830134","doi":"https://doi.org/10.1145/1142473.1142570","mag":"2061830134"},"language":"en","primary_location":{"id":"doi:10.1145/1142473.1142570","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142473.1142570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074540538","display_name":"Karsten Borgwardt","orcid":"https://orcid.org/0000-0001-7221-2393"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karsten Borgwardt","raw_affiliation_strings":["Ludwig-Maximilians-University, Munich, Germany","Ludwig- Maximilians-University Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-University, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]},{"raw_affiliation_string":"Ludwig- Maximilians-University Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108470215","display_name":"Sebastian B\u00f6ttger","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian B\u00f6ttger","raw_affiliation_strings":["Ludwig-Maximilians-University, Munich, Germany","Ludwig- Maximilians-University Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-University, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]},{"raw_affiliation_string":"Ludwig- Maximilians-University Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109848174","display_name":"Hans\u2010Peter Kriegel","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hans-Peter Kriegel","raw_affiliation_strings":["Ludwig-Maximilians-University, Munich, Germany","Ludwig- Maximilians-University Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-University, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]},{"raw_affiliation_string":"Ludwig- Maximilians-University Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"733","last_page":"735"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7302592396736145},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6111252307891846},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5523095726966858},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.526904821395874},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45749837160110474},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.45418891310691833},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42237526178359985},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3763113021850586},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2914927005767822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22536233067512512},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1998981237411499}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7302592396736145},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6111252307891846},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5523095726966858},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.526904821395874},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45749837160110474},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.45418891310691833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42237526178359985},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3763113021850586},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2914927005767822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22536233067512512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1998981237411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1142473.1142570","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142473.1142570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W241117969","https://openalex.org/W1542652324","https://openalex.org/W1600348603","https://openalex.org/W1816257748","https://openalex.org/W1835509607","https://openalex.org/W2007572995","https://openalex.org/W2029382024","https://openalex.org/W2065534534","https://openalex.org/W2085908220","https://openalex.org/W2153635508","https://openalex.org/W2169528473","https://openalex.org/W2170726034","https://openalex.org/W2318794083","https://openalex.org/W2527497076","https://openalex.org/W2560674852","https://openalex.org/W3119651796","https://openalex.org/W3120421331","https://openalex.org/W6638258969","https://openalex.org/W6685290738"],"related_works":["https://openalex.org/W2379764279","https://openalex.org/W2360924501","https://openalex.org/W2766237626","https://openalex.org/W2372895815","https://openalex.org/W2167833628","https://openalex.org/W2349474539","https://openalex.org/W2366583813","https://openalex.org/W4281622723","https://openalex.org/W3115442681","https://openalex.org/W2391000461"],"abstract_inverted_index":{"As":[0],"more":[1,3],"and":[2,26,41,76,90,131,133,137],"graph":[4,12,36,48,74,125],"data":[5,20,30,117],"become":[6],"available":[7],"in":[8,19,32,80],"various":[9],"application":[10],"domains,":[11],"mining":[13,31,118],"is":[14,38,86,93],"of":[15,140],"ever":[16],"increasing":[17],"importance":[18],"management.Graph":[21],"kernels":[22,37,49,75],"are":[23],"a":[24,57,81],"novel":[25],"successful":[27],"method":[28],"for":[29,97],"graphs.":[33],"Unfortunately,":[34],"implementing":[35],"not":[39],"trivial,":[40],"few":[42],"applied":[43],"researchers":[44],"have":[45],"therefore":[46],"used":[47],"so":[50],"far.":[51],"In":[52],"this":[53],"demonstration,":[54],"we":[55],"present":[56],"Java":[58],"software":[59],"package":[60],"called":[61],"Visual":[62],"Graph":[63],"Mining":[64],"(VGM).":[65],"VGM":[66,114],"allows":[67],"the":[68],"user":[69,83],"to":[70,88,95,107],"classify":[71],"graphs":[72,136],"using":[73],"Support":[77,98,109],"Vector":[78,99,110],"Machines":[79],"graphical":[82],"interface":[84],"that":[85],"easy":[87],"learn":[89],"use.":[91],"It":[92],"linked":[94],"LIBSVM":[96],"Machine":[100,111],"computations,":[101],"yet":[102],"can":[103,144],"be":[104,145],"easily":[105],"transferred":[106],"other":[108],"packages.":[112],"Furthermore,":[113],"provides":[115],"basic":[116],"features":[119],"such":[120,127],"as":[121,128],"Nearest":[122],"Neighbor":[123],"search,":[124],"algorithms":[126],"Dijkstra,":[129],"Floyd-Warshall,":[130],"computes":[132],"visualizes":[134],"product":[135],"topological":[138],"indices":[139],"graphs.VGM":[141],"'s":[142],"homepage":[143],"found":[146],"at:":[147],"http://www.cip.ifi.lmu.de/~boettger/sigmod.":[148]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}