{"id":"https://openalex.org/W2125894476","doi":"https://doi.org/10.1109/isic.2008.4635957","title":"Improved Performance Bounds on Max-Product Algorithms for Multiple Fault Diagnosis in Graphs with Loops","display_name":"Improved Performance Bounds on Max-Product Algorithms for Multiple Fault Diagnosis in Graphs with Loops","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2125894476","doi":"https://doi.org/10.1109/isic.2008.4635957","mag":"2125894476"},"language":"en","primary_location":{"id":"doi:10.1109/isic.2008.4635957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isic.2008.4635957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Intelligent Control","raw_type":"proceedings-article"},"type":"article","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/A5052691570","display_name":"Tung Le","orcid":"https://orcid.org/0000-0003-0278-0955"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tung Le","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, IL, USA","Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana- Champaign, Urbana, IL"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana- Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030551100","display_name":"Christoforos N. Hadjicostis","orcid":"https://orcid.org/0000-0002-1706-708X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christoforos N. Hadjicostis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, IL, USA","Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana- Champaign, Urbana, IL"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana- Champaign, Urbana, IL","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052691570"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.645,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.87122586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"637","last_page":"642"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13293","display_name":"Engineering and Test Systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13293","display_name":"Engineering and Test Systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12127","display_name":"Software System Performance and Reliability","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bipartite-graph","display_name":"Bipartite graph","score":0.7613542079925537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7017050981521606},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5734677314758301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5278189778327942},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5240735411643982},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5192568302154541},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5089931488037109},{"id":"https://openalex.org/keywords/false-alarm","display_name":"False alarm","score":0.4647744297981262},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4543234407901764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3457200527191162},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22783857583999634},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15450337529182434}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7613542079925537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7017050981521606},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5734677314758301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5278189778327942},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5240735411643982},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5192568302154541},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5089931488037109},{"id":"https://openalex.org/C2776836416","wikidata":"https://www.wikidata.org/wiki/Q1364844","display_name":"False alarm","level":2,"score":0.4647744297981262},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4543234407901764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3457200527191162},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22783857583999634},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15450337529182434},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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":"doi:10.1109/isic.2008.4635957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isic.2008.4635957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Intelligent Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1530215352","https://openalex.org/W1534245967","https://openalex.org/W1834893312","https://openalex.org/W1977252408","https://openalex.org/W2000805819","https://openalex.org/W2125894476","https://openalex.org/W2130178369","https://openalex.org/W2155387571","https://openalex.org/W2159080219"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2115167491","https://openalex.org/W2046546488"],"abstract_inverted_index":{"In":[0],"this":[1,113,143],"paper,":[2],"we":[3,107],"analyze":[4,111],"the":[5,16,62,72,80,83,87,97,102,115,123,129,139,158],"performance":[6,116],"of":[7,35,38,42,47,58,82,96,117,128,131,150],"belief":[8],"propagation":[9],"max-product":[10,98,104],"algorithms":[11,119],"when":[12,157],"used":[13],"to":[14,78,110,122,147],"solve":[15],"multiple":[17],"fault":[18],"diagnosis":[19,30],"(MFD)":[20],"problem.":[21],"The":[22],"MFD":[23],"problem":[24],"is":[25,77,162],"described":[26],"by":[27],"a":[28,36,40,45,56,89],"bipartite":[29],"graph":[31],"(BDG)":[32],"which":[33,170],"consists":[34],"set":[37,41,46,57],"components,":[39],"alarms,":[43],"and":[44,68,101],"connections":[48],"(or":[49],"causal":[50],"dependencies)":[51],"between":[52],"them,":[53],"along":[54],"with":[55,120,180],"parameters":[59],"that":[60,85,138,172],"describe":[61],"prior":[63],"probabilities":[64],"for":[65],"component,":[66],"alarm":[67,73],"connection":[69],"failures.":[70],"Given":[71],"observations,":[74],"our":[75,173],"goal":[76],"find":[79],"status":[81],"components":[84],"has":[86],"maximum":[88],"posteriori":[90],"(MAP)":[91],"probability.":[92],"By":[93],"using":[94],"properties":[95],"algorithm":[99,105],"(MPA)":[100],"sequential":[103],"(SMPA),":[106],"are":[108,145],"able":[109],"in":[112,142],"paper":[114,144],"both":[118],"respect":[121],"MAP":[124],"solution":[125],"(in":[126],"terms":[127],"probability":[130],"erroneous":[132],"diagnosis).":[133],"Our":[134],"theoretical":[135,174],"analysis":[136],"indicates":[137],"upper":[140,175],"bounds":[141,176],"up":[146],"several":[148],"orders":[149],"magnitude":[151],"better":[152],"than":[153],"existing":[154],"bounds,":[155],"especially":[156],"smallest":[159],"loop":[160],"size":[161],"an":[163],"odd":[164],"number.":[165],"We":[166],"also":[167],"provide":[168],"examples":[169],"demonstrate":[171],"match":[177],"very":[178],"well":[179],"simulation":[181],"results.":[182]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}