Skip to main content
SpringerLink
Log in

Methods for Reducing the Number of Representatives in Representation Choice Tasks

  • Conference paper
Innovations in Applied Artificial Intelligence (IEA/AIE 2004)

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

  • 1667 Accesses

Abstract

A representation choice problem is based on the selection of an object (or objects) called a representative (or representatives), which should at best represent a given set of objects. For solving this problem in the most of cases one defines a distance function between objects and representation choice functions (choice criteria). However, it often happens that the number of representatives is too large, what in many practical situations is not convenient for decision making processes and information management. In this paper the authors propose 3 methods for solving the problem of representatives number reduction. Some examples illustrating these methods are also included.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arrow, K.J.: Social choice and individual values. Wiley, New York (1963)

    Google Scholar 

  2. Aizerman, M.A.: New problems in the general choice theory. Social Choice Welfare 2, 235–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barthelemy, J.P., Janowitz, M.F.: A formal theory of consensus. SIAM J. Discrete Math. 4, 305–322 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Daniłowicz, C., Nguyen, N.T.: Consensus methods for solving inconsistency of replicated data in distributed systems. Distributed and Parallel Databases – An International Journal 14(1), 53–69 (2003)

    Article  Google Scholar 

  5. Daniłowicz, C., Nguyen, N.T.: Criteria and functions for expert information representation choice. In: Kłopotek, et al. (eds.) Proceedings of 10th Int. Conference on Intelligent Information Systems 2001, pp. 225–234. Physica-Verlag (2001)

    Google Scholar 

  6. Daniłowicz, C., Nguyen, N.T., Jankowski, L.: Methods for choice of representation of agent knowledge states in multiagent systems. Monograph, Wroclaw University of Technology Press (2002) (in Polish)

    Google Scholar 

  7. Day, W.H.E.: Consensus methods as tools for data analysis. In: Bock, H.H. (ed.) Classification and Related Methods for Data Analysis, pp. 312–324. North-Holland, Amsterdam (1988)

    Google Scholar 

  8. Fishburn, P.C.: Condorcet social choice functions. SIAM J. App. Math. 33, 469–489 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  9. Katarzyniak, R., Nguyen, N.T.: Solving conflicts of agent knowledge states in multiagent systems. In: Grosky, W.I., Plášil, F. (eds.) SOFSEM 2002. LNCS, vol. 2540, pp. 231–239. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Katarzyniak, R., Nguyen, N.T.: Modification of Weights of Conflict Profile’s Elements and Dependencies of Attributes in Consensus Model. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 131–138. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. McMorris, F.R., Powers, R.C.: The median procedure in a formal theory of consensus. SIAM J. Discrete Math. 14, 507–516 (1995)

    Article  MathSciNet  Google Scholar 

  12. McMorris, F.R., Powers, R.C.: The median function on weak hierarchies. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 37, 265–269 (1997)

    MathSciNet  Google Scholar 

  13. Malowiecki, M., Nguyen, N.T., Zgrzywa, M.: Using Consistency Measures and Attribute Dependencies for Solving Conflicts in Adaptive Systems. In: Proceedings of ICCS 2004, Krakow Poland, June 2004. LNCS, Springer, Heidelberg (2004) (to appear)

    Google Scholar 

  14. Nguyen, N.T.: Using Consensus Methods for Solving Conflicts of Data in Distributed Systems. In: Jeffery, K., Hlaváč, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol. 1963, pp. 409–417. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Nguyen, N.T.: Using distance functions to solve representation choice problems. Fundamenta Informaticae 48(4), 295–314 (2001)

    MathSciNet  Google Scholar 

  16. Nguyen, N.T.: Consensus system for solving conflicts in distributed systems. Journal of Information Sciences 147, 91–122 (2002)

    Article  MATH  Google Scholar 

  17. Nguyen, N.T.: Representation Choice Methods as The Tool for Solving Uncertainty in Distributed Temporal Database Systems with Indeterminate Valid Time. In: Monostori, L., Váncza, J., Ali, M. (eds.) IEA/AIE 2001. LNCS (LNAI), vol. 2070, pp. 445–454. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Nguyen, N.T.: Using consensus for solving conflict situations in fault-tolerant distributed systems. In: Proceedings of First IEEE/ACM Symposium on Cluster Computing and the Grid 2001, Australia, pp. 379–385. IEEE Computer Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  19. Nguyen, N.T., Sobecki, J.: Using Consensus Methods to Construct Adaptive Interfaces in Multimodal Web-based Systems. Journal of Universal Access in the Information Society 2(4), 342–358 (2003)

    Article  Google Scholar 

  20. Nguyen, N.T.: Consensus-based timestamps in distributed temporal databases. The Computer Journal 44(5), 398–409 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Wroclaw University of Technology, Poland

    N. T. Nguyen & C. Danilowicz

Authors
  1. N. T. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Danilowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Information Technology, National Research Council of Canada, 1200 Montreal Read, M-50, K1A 0R6, Ottawa, Ontario, Canada

    Bob Orchard

  2. Institute for Information Technology, National Research Council, Canada

    Chunsheng Yang

  3. Department of Computer Science, Texas State University-San Marcos, Nueces 247, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, N.T., Danilowicz, C. (2004). Methods for Reducing the Number of Representatives in Representation Choice Tasks. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24677-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22007-7

  • Online ISBN: 978-3-540-24677-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation