Skip to main content
SpringerLink
Log in
Book cover

Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing pp 298–309Cite as

The Borda Count, the Intersection and the Highest Rank Method in a Dispersed Decision-Making System

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9437))

Abstract

The main aim of the article is to compare the results obtained using three different methods of conflict analysis in a dispersed decision-making system. The conflict analysis methods, used in the article, are discussed in the paper of Ho, Hull and Srihari [6] and in the book of Black [2]. All these methods are used if the individual classifiers generate rankings of classes instead of unique class choices. The first method is the Borda count method, which is a generalization of the majority vote. The second is the intersection method, which belong to the class set reduction method. The third one is the highest rank method, which belong to the methods for class set reordering. All of these methods were used in a dispersed decision-making system which was proposed in the paper [12].

This is a preview of subscription content, log in via an institution.

References

  1. Bazan, J., Peters, J., Skowron, A., Nguyen, H., Szczuka, M.: Rough set approach to pattern extraction from classifiers. Electron. Notes Theor. Comput. Sci. 82, 20–29 (2003)

    Article  MATH  Google Scholar 

  2. Black, D.: The Theory of Committees and Elections. University Press, Cambridge (1958)

    MATH  Google Scholar 

  3. Delimata, P., Suraj, Z.: Feature selection algorithm for multiple classifier systems: a hybrid approach. Fundamenta Informaticae 85(1–4), 97–110 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach. Learn. 40(2), 139–157 (2000)

    Article  Google Scholar 

  5. Gou, J., Xiong, T., Kuang, Y.: A novel weighted voting for K-Nearest neighbor rule. J. Comput. 6(5), 833–840 (2011)

    Article  Google Scholar 

  6. Ho, T.K., Hull, J.J., Srihari, S.N.: Decision combination in multiple classifier systems. IEEE Trans. Pattern Anal. Mach. Intell. 16(1), 66–75 (1994)

    Article  Google Scholar 

  7. Kononenko, I., Simec, E., Robnik-Sikonja, M.: Overcoming the myopia of inductive learning algorithms with RELIEFF. Appl. Intell. 7(1), 39–55 (1997)

    Article  Google Scholar 

  8. Pawlak, Z.: On conflicts. Int. J. of Man-Mach. Stud. 21, 127–134 (1984)

    Article  MATH  Google Scholar 

  9. Pawlak, Z.: An inquiry anatomy of conflicts. J. Inf. Sci. 109, 65–78 (1998)

    Article  MathSciNet  Google Scholar 

  10. Przybyła-Kasperek, M., Wakulicz-Deja, A.: Application of reduction of the set of conditional attributes in the process of global decision-making. Fundamenta Informaticae 122(4), 327–355 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  11. Przybyła-Kasperek, M., Wakulicz-Deja, A.: Global decision-making system with dynamically generated clusters. Inf. Sci. 270, 172–191 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Przybyła-Kasperek, M., Wakulicz-Deja, A.: A dispersed decision-making system - the use of negotiations during the dynamic generation of a systems structure. Inf. Sci. 288, 194–219 (2014)

    Article  MATH  Google Scholar 

  13. Schneeweiss, C.: Distributed Decision Making. Springer, Berlin (2003)

    Book  MATH  Google Scholar 

  14. Skowron, A., Wang, H., Wojna, A., Bazan, J.: Multimodal classification: case studies. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 224–239. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Soria, D., Garibaldi, J.M., Ambrogi, F., Biganzoli, E., Ellis, I.O.: A ‘non-parametric’ version of the naive Bayes classifier. Knowl.-Based Syst. 24(6), 775–784 (2011)

    Article  Google Scholar 

  16. Ślȩzak, D., Wróblewski, J., Szczuka, M.: Neural network architecture for synthesis of the probabilistic rule based classifiers. Electron. Notes Theor. Comput. Sci. 82, 251–262 (2003)

    Article  MATH  Google Scholar 

  17. Wakulicz-Deja, A., Przybya-Kasperek, M.: Application of the method of editing and condensing in the process of global decision-making. Fundamenta Informaticae 106(1), 93–117 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, Bȩdzińska 39, 41-200, Sosnowiec, Poland

    Małgorzata Przybyła-Kasperek

Authors
  1. Małgorzata Przybyła-Kasperek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Małgorzata Przybyła-Kasperek .

Editor information

Editors and Affiliations

  1. University of Regina, Regina, SK, Canada

    Yiyu Yao

  2. Tianjin University, Tianjin, China

    Qinghua Hu

  3. Chongqing University of Posts and Telecommunications, Chongqing, China

    Hong Yu

  4. University of Kansas, Lawrence, KS, USA

    Jerzy W. Grzymala-Busse

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Przybyła-Kasperek, M. (2015). The Borda Count, the Intersection and the Highest Rank Method in a Dispersed Decision-Making System. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Lecture Notes in Computer Science(), vol 9437. Springer, Cham. https://doi.org/10.1007/978-3-319-25783-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25783-9_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25782-2

  • Online ISBN: 978-3-319-25783-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation