Conditioning w.r.t. random sets. Part 2: combination rules.
Saved in:
| Title: | Conditioning w.r.t. random sets. Part 2: combination rules. |
|---|---|
| Authors: | Bronevich, Andrey G.1 (AUTHOR) brone@mail.ru |
| Source: | International Journal of General Systems. Aug2025, Vol. 54 Issue 6, p787-824. 38p. |
| Subjects: | Random sets, Dempster-Shafer theory, Consensus (Social sciences), Uncertainty (Information theory) |
| Abstract: | Part 2 of this article is devoted to the analysis of a new class of combination rules on belief functions generated by conditioning w.r.t. random sets and their linear convex combinations. Each such rule obeys two requirements: the consensus requirement with the conjunction rule means that this rule coincides with Dempster's rule on non-conflicting sources of information, and the consensus requirement with a mixture rule means that the result must be a specialization of their mixture combination. We show that this new class of combination rules is closed under convex combinations of such rules and their compositions. This allows us to implement the conflict management using the introduced functionals for measuring the specialization relation on belief functions. We also introduce similar rules for idempotent combination rules on credal sets obeying the similar consensus requirements and study the results obtained using various examples. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of General Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 186874822 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Conditioning w.r.t. random sets. Part 2: combination rules. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bronevich%2C+Andrey+G%2E%22">Bronevich, Andrey G.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> brone@mail.ru</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+General+Systems%22">International Journal of General Systems</searchLink>. Aug2025, Vol. 54 Issue 6, p787-824. 38p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Random+sets%22">Random sets</searchLink><br /><searchLink fieldCode="DE" term="%22Dempster-Shafer+theory%22">Dempster-Shafer theory</searchLink><br /><searchLink fieldCode="DE" term="%22Consensus+%28Social+sciences%29%22">Consensus (Social sciences)</searchLink><br /><searchLink fieldCode="DE" term="%22Uncertainty+%28Information+theory%29%22">Uncertainty (Information theory)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Part 2 of this article is devoted to the analysis of a new class of combination rules on belief functions generated by conditioning w.r.t. random sets and their linear convex combinations. Each such rule obeys two requirements: the consensus requirement with the conjunction rule means that this rule coincides with Dempster's rule on non-conflicting sources of information, and the consensus requirement with a mixture rule means that the result must be a specialization of their mixture combination. We show that this new class of combination rules is closed under convex combinations of such rules and their compositions. This allows us to implement the conflict management using the introduced functionals for measuring the specialization relation on belief functions. We also introduce similar rules for idempotent combination rules on credal sets obeying the similar consensus requirements and study the results obtained using various examples. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of General Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=186874822 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/03081079.2024.2427246 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 38 StartPage: 787 Subjects: – SubjectFull: Random sets Type: general – SubjectFull: Dempster-Shafer theory Type: general – SubjectFull: Consensus (Social sciences) Type: general – SubjectFull: Uncertainty (Information theory) Type: general Titles: – TitleFull: Conditioning w.r.t. random sets. Part 2: combination rules. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bronevich, Andrey G. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 03081079 Numbering: – Type: volume Value: 54 – Type: issue Value: 6 Titles: – TitleFull: International Journal of General Systems Type: main |
| ResultId | 1 |
