{"id":"https://openalex.org/W1486586747","doi":null,"title":"Classification of large Graphs by a local Tree decomposition","display_name":"Classification of large Graphs by a local Tree decomposition","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1486586747","mag":"1486586747"},"language":"en","primary_location":{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/b384a301-adaf-46eb-b3c3-1354b1c94540","doi":null,"is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/b384a301-adaf-46eb-b3c3-1354b1c94540","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emmert-Streib, F, Dehmer, M & Kilian, E 2005, 'Classification of large Graphs by a local Tree decomposition', Paper presented at International Conference on Data Mining (DMIN 05), Las Vegas, United States, 01/06/2005 - 01/06/2005 pp. 200-207.","raw_type":"info:eu-repo/semantics/conferenceObject"},"parent_works":[],"lineage":["https://openalex.org/W1486586747"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5057625030","display_name":"Frank Emmert\u2010Streib","orcid":"https://orcid.org/0000-0003-0745-5641","observed_orcids":["https://orcid.org/0000-0003-0745-5641"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Frank Emmert\u2010Streib","raw_affiliation_strings":["School of Medicine, Dentistry and Biomedical Sciences, Centre for Cancer Research and Cell Biology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Medicine, Dentistry and Biomedical Sciences, Centre for Cancer Research and Cell Biology","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044244385","display_name":"Matthias Dehmer","orcid":"https://orcid.org/0000-0001-8454-5857","observed_orcids":["https://orcid.org/0000-0001-8454-5857"]},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Matthias Dehmer","raw_affiliation_strings":["Technische Universit\u00e4t Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085279839","display_name":"J\u00fcrgen Kilian","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"J\u00fcrgen Kilian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7558,"has_fulltext":false,"cited_by_count":31,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.90342679,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"207"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9580000042915344,"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.9580000042915344,"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/T11476","display_name":"Graph theory and applications","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.007899999618530273,"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-classification","display_name":"graph classification","score":0.984000027179718},{"id":"https://openalex.org/keywords/tree-similarity","display_name":"tree similarity","score":0.8370000123977661},{"id":"https://openalex.org/keywords/similarity-distribution","display_name":"similarity distribution","score":0.8080000281333923},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.578000009059906},{"id":"https://openalex.org/keywords/unweighted-undirected-graphs","display_name":"unweighted undirected graphs","score":0.8339999914169312},{"id":"https://openalex.org/keywords/microarray-data","display_name":"microarray data","score":0.7749999761581421},{"id":"https://openalex.org/keywords/cervical-cancer","display_name":"cervical cancer","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5011570453643799},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.49487632513046265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47941824793815613},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.47388121485710144},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43975651264190674},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.42473191022872925},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3813874125480652},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38119596242904663},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2091871201992035},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18115904927253723}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/b384a301-adaf-46eb-b3c3-1354b1c94540","doi":null,"is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/b384a301-adaf-46eb-b3c3-1354b1c94540","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emmert-Streib, F, Dehmer, M & Kilian, E 2005, 'Classification of large Graphs by a local Tree decomposition', Paper presented at International Conference on Data Mining (DMIN 05), Las Vegas, United States, 01/06/2005 - 01/06/2005 pp. 200-207.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1486586747","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/dmin/dmin2005.html#Emmert-StreibDK05","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":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1528914253","https://openalex.org/W1814133457","https://openalex.org/W2024519892","https://openalex.org/W2028231353","https://openalex.org/W2057294899","https://openalex.org/W2073067110","https://openalex.org/W2126359798","https://openalex.org/W2163509192","https://openalex.org/W2169528473","https://openalex.org/W2243767758","https://openalex.org/W2341171179","https://openalex.org/W2734353507"],"related_works":["https://openalex.org/W4230395237","https://openalex.org/W4231981071","https://openalex.org/W2583123213","https://openalex.org/W2138152898","https://openalex.org/W2160607502","https://openalex.org/W2169332582","https://openalex.org/W7214254781","https://openalex.org/W2170863066","https://openalex.org/W7096991160","https://openalex.org/W7100747629"],"abstract_inverted_index":{"We":[0,81],"present":[1],"a":[2,18,43,52,78],"binary":[3],"graph":[4,23,79],"classifier":[5],"(BGC)":[6],"which\nallows":[7],"to":[8,87],"classify":[9],"large,":[10],"unweighted,":[11],"undirected":[12],"graphs.":[13],"This\nclassifier":[14],"is":[15,62],"based":[16],"on":[17],"local":[19],"decomposition":[20],"of":[21,56,98],"the":[22,33,36,48,57,83],"for":[24,94],"each\nnode":[25],"in":[26,59,77],"generalized":[27,44],"trees.":[28],"The":[29],"obtained":[30],"trees,":[31],"forming":[32],"tree":[34,71],"set\nof":[35],"graph,":[37],"are":[38],"then":[39],"pairwise":[40],"compared":[41],"by":[42],"treesimilarity-\nalgorithm":[45],"(GTSA)":[46],"and":[47,69,73,93],"resulting":[49,75],"similarity":[50,54],"scores\ndetermine":[51],"characteristic":[53],"distribution":[55],"graph.\nClassification":[58],"this":[60,85],"context":[61],"defined":[63],"as":[64],"mutual":[65],"consistency\nfor":[66],"all":[67],"pure":[68],"mixed":[70],"sets":[72],"their":[74],"similarity\ndistributions":[76],"class.":[80],"demonstrate":[82],"application\nof":[84],"method":[86],"an":[88],"artificially":[89],"generated":[90],"data":[91],"set":[92],"data\nfrom":[95],"microarray":[96],"experiments":[97],"cervical":[99],"cancer.":[100]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1486586747","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
