{"id":"https://openalex.org/W3006422638","doi":"https://doi.org/10.5555/1577069.1577107","title":"An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity","display_name":"An Algorithm for Reading Dependencies from the Minimal Undirected Independence Map of a Graphoid that Satisfies Weak Transitivity","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W3006422638","doi":"https://doi.org/10.5555/1577069.1577107","mag":"3006422638"},"language":"en","primary_location":{"id":"mag:3006422638","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/1577069.1577107","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Machine Learning Research","raw_type":null},"type":"article","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/A5091799105","display_name":"M Pe\u00f1aJose","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M Pe\u00f1aJose","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091573841","display_name":"NilssonRoland","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"NilssonRoland","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021505926","display_name":"Bj\u00f6rkegrenJohan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bj\u00f6rkegrenJohan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007635038","display_name":"Tegn\u00e9rJesper","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tegn\u00e9rJesper","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091799105"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7068,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74770484,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955999851226807,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.8207055926322937},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.7152971625328064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5527321100234985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5224465727806091},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.49024611711502075},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.45460033416748047},{"id":"https://openalex.org/keywords/conditional-independence","display_name":"Conditional independence","score":0.4532987177371979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43935689330101013},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37941431999206543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3577769994735718},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33462172746658325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33376869559288025},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13090834021568298},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.08072727918624878},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07449716329574585}],"concepts":[{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.8207055926322937},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.7152971625328064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5527321100234985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5224465727806091},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.49024611711502075},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.45460033416748047},{"id":"https://openalex.org/C79772020","wikidata":"https://www.wikidata.org/wiki/Q5159264","display_name":"Conditional independence","level":2,"score":0.4532987177371979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43935689330101013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37941431999206543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3577769994735718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33462172746658325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33376869559288025},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13090834021568298},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.08072727918624878},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07449716329574585},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:3006422638","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/1577069.1577107","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Machine Learning Research","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.8199999928474426,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2001039136","https://openalex.org/W2022368411","https://openalex.org/W2371151875","https://openalex.org/W2732568759","https://openalex.org/W1974960803","https://openalex.org/W175722296","https://openalex.org/W1997878505","https://openalex.org/W2764268078","https://openalex.org/W189043490","https://openalex.org/W1576029487","https://openalex.org/W2263539652","https://openalex.org/W2012063573","https://openalex.org/W2110920860"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,19],"sound":[3],"and":[4],"complete":[5,27],"graphical":[6],"criterion":[7],"for":[8],"reading":[9],"dependencies":[10],"from":[11],"the":[12],"minimal":[13],"undirected":[14],"independence":[15],"map":[16],"G":[17],"of":[18],"graphoid":[20],"M":[21],"that":[22],"satisfies":[23],"weak":[24],"transitivity.":[25],"Here,":[26],"means":[28],"th...":[29]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}