• DocumentCode
    2821052
  • Title

    Conflict Analysis Based on Discernibility and Indiscernibility

  • Author

    Yao, Yiyu ; Zhao, Yan

  • Author_Institution
    Dept. of Comput. Sci., Regina Univ., Sask.
  • fYear
    2007
  • fDate
    1-5 April 2007
  • Firstpage
    302
  • Lastpage
    307
  • Abstract
    The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indiscernibility reveals the similarities. By considering them together in a same framework, one is able to obtain new insight of data. The main objective of the paper is to apply discernibility and indiscernibility to conflict analysis, a theory dealing with opinions of a set of agents on a set of issues. In particular, we are interested in the problem of issue reduction, so that a reduced set of issues can be obtained without loss of crucial information of the original set of issues. Extending the results from rough set theory, three types of issue reducts are introduced. They correspond to discernibility, indiscernibility, and discernibility-and-indiscernibility reducts, respectively. The results of this paper may offer a new research direction in rough set analysis in general, and conflict analysis in particular.
  • Keywords
    rough set theory; conflict analysis; discernibility framework; indiscernibility framework; intelligent data analysis; issue reduction; rough set theory; Atmosphere; Competitive intelligence; Computational intelligence; Computer science; Data analysis; Data mining; Information systems; Machine learning; Rough sets; Set theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computational Intelligence, 2007. FOCI 2007. IEEE Symposium on
  • Conference_Location
    Honolulu, HI
  • Print_ISBN
    1-4244-0703-6
  • Type

    conf

  • DOI
    10.1109/FOCI.2007.372184
  • Filename
    4233922