ScholarLens Back to search
2011•Kongzhi yu jueceRequires access

Fault rule matching optimization algorithm based on bipartite graph

Zuhui Hu

Open publisher page 0 citations

Abstract

According to traditional fault rule matching method based on similarity taking no account of overall matching degree between input conditions and rule antecedents,bipartite graph optimal matching method is adopted to optimize the matching process in this paper.Then it is applied to fault diagnosis reasoning,and fault rule matching optimization algorithm based on bipartite graph is proposed.The example analysis shows that,compared with other similarity matching algorithms, the proposed algorithm effectively improves the accuracy of matching rules and reduces the matching time meanwhile.

About this research paper

What this paper is about

According to traditional fault rule matching method based on similarity taking no account of overall matching degree between input conditions and rule antecedents,bipartite graph optimal matching method is adopted to optimize the matching process in this paper.Then it is applied to fault diagnosis reasoning,and fault rule matching optimization algorithm based on bipartite graph is proposed.The example analysis shows that,compared with other similarity matching algorithms, the proposed algorithm effectively improves the accuracy of matching rules and reduces the matching time meanwhile.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

According to traditional fault rule matching method based on similarity taking no account of overall matching degree between input conditions and rule antecedents,bipartite graph optimal matching method is adopted to optimize the matching process in this paper.Then it is applied to fault diagnosis reasoning,and fault rule matching optimization algorithm based on bipartite graph is proposed.The example analysis shows that,compared with other similarity matching algorithms, the proposed algorithm effectively improves the accuracy of matching rules and reduces the matching time meanwhile.

Key concepts: Bipartite graph, Matching (statistics), Blossom algorithm, 3-dimensional matching, Optimal matching, Similarity (geometry), Algorithm, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Fault rule matching optimization algorithm based on bipartite graph — Research Paper | ScholarLens