Skip to main content

Pawlak Collaboration Graph and Its Properties

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC 2011)

Abstract

Nowadays, special kind of information gaining popularity is the one coming from social networks. In the paper we study basic statistical and graph-theoretical properties of the collaboration graph, which is an example of a large social network. To build such graph we use the data collected in the Rough Set Database System [9]. The collaboration graph contains data, among others, on Z. Pawlak, his co-authors, their co-authors, et cetera. In principle, the main idea presented in the paper is similar to the one of Erdos number [3], enriched with some concepts and techniques from social network analysis [1]. Analyzing our data we discover hidden patterns of collaboration among members of the rough set community [6],[8] which can be interesting for this community and others. Our data also provides fairly large, appealing real-life graphs on which one can test graph algorithms, in the spirit of [4].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Batagelj, V., Mrvar, A.: Some Analyses of Erdös Collaboration Graph. Social Networks 22(2), 173–186 (2000)

    Article  MathSciNet  Google Scholar 

  2. Grossman, J.W.: Patterns of Collaboration in Mathematical Research. SIAM News 35(9) (2002)

    Google Scholar 

  3. Grossman, J.W.: The Erdös Number Project (1996), http://www.oakland.edu/grossman/erdoshp.html

  4. Knuth, D.: The Stanford GraphBase. Addison-Wesley, Reading (1993)

    MATH  Google Scholar 

  5. Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning About Data. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

  6. Suraj, Z., Grochowalski, P.: Patterns of Collaborations in Rough Set Research. Studies in Fuzziness and Soft Computing, vol. 224, pp. 79–92. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  7. Suraj, Z., Grochowalski, P.: The Rough Set Database System. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 307–331. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Suraj, Z., Grochowalski, P.: Some Comparative Analyses of Data in the RSDS System. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds.) RSKT 2010. LNCS, vol. 6401, pp. 8–15. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Website of the RSDS system, http://rsds.univ.rzeszow.pl

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suraj, Z., Grochowalski, P., Lew, Ł. (2011). Pawlak Collaboration Graph and Its Properties. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2011. Lecture Notes in Computer Science(), vol 6743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21881-1_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21881-1_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21880-4

  • Online ISBN: 978-3-642-21881-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics