{"id":"https://openalex.org/W2183577221","doi":null,"title":"Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering","display_name":"Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering","publication_year":2010,"publication_date":"2010-06-16","ids":{"openalex":"https://openalex.org/W2183577221","mag":"2183577221"},"language":"en","primary_location":{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/34008","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-07142010-194659/","pdf_url":"http://hdl.handle.net/10919/34008","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10919/34008","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085475149","display_name":"Evan K. Maxwell","orcid":"https://orcid.org/0000-0002-7325-7531","observed_orcids":["https://orcid.org/0000-0002-7325-7531"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Evan K. Maxwell","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7325-7531","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5085475149"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-mining","display_name":"graph mining","score":0.9810000061988831},{"id":"https://openalex.org/keywords/dominator-trees","display_name":"dominator trees","score":0.9229999780654907},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6029999852180481},{"id":"https://openalex.org/keywords/caenorhabditis-elegans","display_name":"Caenorhabditis elegans","score":0.7940000295639038},{"id":"https://openalex.org/keywords/relational-databases","display_name":"relational databases","score":0.42899999022483826}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6739746332168579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5889050364494324},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5472890138626099},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46840402483940125},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4178958535194397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33476656675338745},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3081144094467163},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3029698133468628}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/34008","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-07142010-194659/","pdf_url":"http://hdl.handle.net/10919/34008","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:2183577221","doi":null,"is_oa":false,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-07142010-194659/unrestricted/Maxwell_EK_T_2010.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:vtechworks.lib.vt.edu:10919/34008","doi":null,"is_oa":true,"landing_page_url":"http://scholar.lib.vt.edu/theses/available/etd-07142010-194659/","pdf_url":"http://hdl.handle.net/10919/34008","source":{"id":"https://openalex.org/S4306400248","display_name":"VTechWorks (Virginia Tech)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I859038795","host_organization_name":"Virginia Tech","host_organization_lineage":["https://openalex.org/I859038795"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1294829759","display_name":"Formal Models, Algorithms, and Visualizations for Storytelling Analytics","funder_award_id":"0937133","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3929404048","display_name":"ITR-(NHS)-(sim):    Computational Models for Gene Silencing:   Elucidating a Pervasive Biological Defensive Response","funder_award_id":"0428344","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333655","display_name":"Institute for Critical Technology and Applied Science","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2183577221.pdf","grobid_xml":"https://content.openalex.org/works/W2183577221.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W119220656","https://openalex.org/W1508113248","https://openalex.org/W1510358061","https://openalex.org/W1512742637","https://openalex.org/W1537336823","https://openalex.org/W1554164734","https://openalex.org/W1577544661","https://openalex.org/W1616338336","https://openalex.org/W1647075334","https://openalex.org/W1968451194","https://openalex.org/W1977186059","https://openalex.org/W1977556410","https://openalex.org/W1986441855","https://openalex.org/W1991546210","https://openalex.org/W1997159952","https://openalex.org/W2000100269","https://openalex.org/W2001799599","https://openalex.org/W2005129098","https://openalex.org/W2011039300","https://openalex.org/W2011251223","https://openalex.org/W2027770225","https://openalex.org/W2040539769","https://openalex.org/W2050035935","https://openalex.org/W2058881329","https://openalex.org/W2064853889","https://openalex.org/W2101654328","https://openalex.org/W2101857770","https://openalex.org/W2102674270","https://openalex.org/W2105204977","https://openalex.org/W2107751776","https://openalex.org/W2109291623","https://openalex.org/W2111379929","https://openalex.org/W2113310577","https://openalex.org/W2118628540","https://openalex.org/W2119424404","https://openalex.org/W2119995149","https://openalex.org/W2121562991","https://openalex.org/W2124770494","https://openalex.org/W2124996875","https://openalex.org/W2125571188","https://openalex.org/W2129181700","https://openalex.org/W2134737843","https://openalex.org/W2136593687","https://openalex.org/W2136850043","https://openalex.org/W2138369269","https://openalex.org/W2141012957","https://openalex.org/W2150718242","https://openalex.org/W2154843497","https://openalex.org/W2154946202","https://openalex.org/W2156858199","https://openalex.org/W2161205232","https://openalex.org/W2164281374","https://openalex.org/W2166140339","https://openalex.org/W2166434533","https://openalex.org/W2170726034","https://openalex.org/W7098665468"],"related_works":["https://openalex.org/W2119424404","https://openalex.org/W2284039845","https://openalex.org/W2887752261","https://openalex.org/W2313127272","https://openalex.org/W3036837373","https://openalex.org/W2018600175","https://openalex.org/W2505468326","https://openalex.org/W7002168311","https://openalex.org/W6885022773","https://openalex.org/W2912210656"],"abstract_inverted_index":{"Large":[0],"graph-based":[1],"datasets":[2],"are":[3],"common":[4,130,256],"to":[5,14,24,36,44,106,143,149,173,183,241,323,333],"many":[6],"applications":[7],"because":[8],"of":[9,34,40,66,78,114,125,160,188,209,234,250,305,315],"the":[10,64,76,122,141,150,156,163,175,185,189,197,220,232,306],"additional":[11],"structure":[12],"provided":[13],"data":[15,263,277,324],"by":[16,308],"graphs.":[17],"Patterns":[18],"extracted":[19],"from":[20,90,166,325],"graphs":[21],"must":[22],"adhere":[23],"these":[25,47,71],"structural":[26],"properties,":[27],"making":[28],"them":[29],"a":[30,83,126,129,145,255,267,273,302,312],"more":[31,217],"complex":[32],"class":[33],"patterns":[35,48],"identify.":[37],"The":[38],"role":[39],"graph":[41,67,79,146,236],"mining":[42,68,81,147],"is":[43,100,128,140,193,264,321],"efficiently":[45],"extract":[46],"and":[49,62,117,162],"quantify":[50],"their":[51],"significance.":[52],"In":[53],"this":[54],"thesis,":[55],"we":[56,74,230,329],"focus":[57],"on":[58,244],"two":[59],"application":[60,119],"domains":[61],"demonstrate":[63,201],"design":[65],"algorithms":[69],"in":[70,103,110,133,155,258],"domains.":[72],"First,":[73],"investigate":[75],"use":[77,104],"grammar":[80],"as":[82,158,204,206,226,238],"tool":[84],"for":[85,212,276,285],"diagnosing":[86],"potential":[87],"memory":[88,98,134],"leaks":[89,95,153],"Java":[91],"heap":[92,123,157,190,210],"dumps.":[93],"Memory":[94,152],"occur":[96],"when":[97],"that":[99,180,271,288,298],"no":[101],"longer":[102],"fails":[105],"be":[107,171],"reclaimed,":[108],"resulting":[109],"significant":[111],"slowdowns,":[112],"exhaustion":[113],"available":[115],"storage,":[116],"eventually":[118],"crashes.":[120],"Analyzing":[121],"dump":[124],"program":[127],"strategy":[131],"used":[132],"leak":[135,176],"diagnosis,":[136],"but":[137,328],"our":[138,214,299],"work":[139],"first":[142],"employ":[144],"approach":[148,215,240],"problem.":[151],"accumulate":[154],"classes":[159],"subgraphs":[161],"allocation":[164],"paths":[165],"which":[167,192,213],"they":[168],"emanate":[169],"can":[170],"explored":[172],"contextualize":[174],"source.":[177],"We":[178,200,279,296],"show":[179,297],"it":[181,310],"suffices":[182],"mine":[184],"dominator":[186],"tree":[187],"dump,":[191],"significantly":[194],"smaller":[195],"than":[196,222],"underlying":[198],"graph.":[199],"several":[202],"synthetic":[203],"well":[205],"real-world":[207],"examples":[208],"dumps":[211],"provides":[216,272],"insight":[218],"into":[219,266,311],"problem":[221,233],"state-of-the-art":[223],"tools":[224],"such":[225,251],"Eclipse's":[227],"MAT.":[228],"Second,":[229],"study":[231],"multipartite":[235,290],"clustering":[237],"an":[239,245,281],"database":[242,294,307],"summarization":[243],"integrated":[246],"biological":[247,259],"database.":[248],"Construction":[249],"databases":[252],"has":[253],"become":[254],"theme":[257],"research,":[260],"where":[261],"heterogeneous":[262],"consolidated":[265],"single,":[268],"centralized":[269],"repository":[270],"structured":[274],"forum":[275],"analysis.":[278],"present":[280],"efficient":[282],"approximation":[283],"algorithm":[284,300,320],"identifying":[286],"clusters":[287],"form":[289],"cliques":[291],"spanning":[292],"multiple":[293],"tables.":[295],"computes":[301],"lossless":[303],"compression":[304],"summarizing":[309],"reduced":[313],"set":[314],"biologically":[316],"meaningful":[317],"clusters.":[318],"Our":[319],"applied":[322],"C.":[326],"elegans,":[327],"note":[330],"its":[331],"applicability":[332],"general":[334],"relational":[335],"databases.":[336]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}