Skip to main content
SpringerLink
Log in
Book cover

Computational Social Network Analysis pp 49–80Cite as

Toward Self-Organizing Search Systems

  • Chapter
  • First Online:

  • 2886 Accesses

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

The huge amount of images, videos, and music clips produced everyday by various digital devices must be processed. Firstly, this kind of data calls for content-based search or similarity search rather than keyword-based or text-based search. Secondly, new scalable and efficient methods capable of storing and querying such data must be developed. Although many distributed approaches exist, one of the most suitable and flexible is provided by self-organizing systems. These systems exhibit high resistance to failures in dynamically changing environments. In this chapter, we propose a general three-layer model for designing and implementing a self-organizing system that aims at searching in multimedia data. This model gives a developer guidelines about what component must be implemented, and how they should behave. The usability of this model is illustrated on a system called Metric Social Network. The architecture of this system is based on the social network theory that is utilized for establishing links between nodes. The system’s properties are verified by organizing and searching in 10 million images.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Ashby WR (1962) Principles of the self-organizing system, in Principles of Self-Organization, Pergamon Press, New York, NY, pp 255–278

    Google Scholar 

  2. Aspnes J, Shah G (November 2007) Skip graphs. ACM Trans Algor 3(4):37:1–37:25

    Google Scholar 

  3. Banaei-Kashani F, Shahabi C (2004) SWAM: a family of access methods for similarity-search in peer-to-peer data networks. In: Proceedings of the 13th ACM conference on information and knowledge management (CIKM 2004). ACM, Springer-Verlag Heidelberg, Margherita di Pula, Cagliari, Italy, pp 304–313

    Google Scholar 

  4. Bartoň S, Dohnal V, Sedmidubský J, Zezula P (2008) Building self-organized image retrieval network. In: Proceedings of the 6th workshop on large-scale distributed systems for information retrieval (LSDS-IR 2008). ACM, New York, USA, pp 51–58

    Google Scholar 

  5. Batko M, Gennaro C, Zezula P (2005) Similarity grid for searching in metric spaces. In: DELOS workshop: digital library architectures. Lecture notes in computer science, Springer-Verlag Heidelberg, Margherita di Pula, Cagliari, Italy, vol 3664/2005:25–44

    Google Scholar 

  6. Batko M, Novak D, Falchi F, Zezula P (2006) On scalability of the similarity search in the world of peers. In: Proceedings of the 1st international conference on scalable information systems (INFOSCALE 2006). ACM, Hong Kong, May 30–1 June, pp 1–12

    Google Scholar 

  7. Beer S (1966) Decision and control: the meaning of operational research and management cybernetics. Wiley, New York

    Google Scholar 

  8. Blaze M, Feigenbaum J, Lacy J (1996) Decentralized trust management. In: Proceedings of the IEEE symposium on security and privacy. IEEE Computer Society, pp 164–173

    Google Scholar 

  9. Blaze M, Feigenbaum J, Strauss M (1998) Compliance checking in the policymaker trust management system. In: Proceedings of the 2nd international conference on financial cryptography (FC 1998). Springer, London, UK, pp 254–274

    Google Scholar 

  10. Blaze M, Feigenbaum J, Ioannidis J, Keromytis AD (1999) The role of trust management in distributed systems security. In: Secure internet programming. Springer, Berlin, pp 185–210

    Google Scholar 

  11. Blaze M, Ioannidis J, Keromytis AD (2002) Trust management for IPsec. ACM Trans Inform Syst Secur 5(2):95–118

    Article  Google Scholar 

  12. Bolettieri P, Esuli A, Falchi F, Lucchese C, Perego R, Piccioli T, Rabitti F (2009) CoPhIR: a test collection for content-based image retrieval. CoRR abs/0905.4627. http://cophir.isti.cnr.it/

    Google Scholar 

  13. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, New York, NY, USA

    MATH  Google Scholar 

  14. Camazine S, Franks NR, Sneyd J, Bonabeau E, Deneubourg JL, Theraula G (2001) Self-organization in biological systems. Princeton University Press, Princeton, NJ, USA

    Google Scholar 

  15. Cao UY, Fukunaga AS, Kahng AB (March 1997) Cooperative mobile robotics: antecedents and directions. Auton Robot 4(1):7–27

    Article  Google Scholar 

  16. Caro GD, Ducatelle F, Gambardella LM (2005) Anthocnet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16:443–455

    Article  Google Scholar 

  17. Chater N, Vitanyi PM (2003) The generalized universal law of generalization. J Math Psychol 47(3):346–369

    Article  MATH  MathSciNet  Google Scholar 

  18. Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Jarke M, Carey MJ, Dittrich KR, Lochovsky FH, Loucopoulos P, Jeusfeld MA (eds) Proceedings of the 23rd international conference on very large data bases (VLDB 1997). Morgan Kaufmann, Athens, Greece, pp 426–435, 25–29 August 1997

    Google Scholar 

  19. Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. In: Proceedings of the 22nd international conference on distributed computing systems (ICDCS 2002). IEEE Computer Society, Washington, DC, USA, p 23

    Google Scholar 

  20. Crespo A, Garcia-Molina H (2004) Semantic overlay networks for p2p systems. In: Proceedings of the 3rd international workshop on agents and peer-to-peer computing (AP2PC 2004), New York, NY, USA, 19 July 2004. Lecture notes in computer science, vol 3601. Springer, pp 1–13

    Google Scholar 

  21. Dohnal V, Gennaro C, Savino P, Zezula P (2003) D-Index: distance searching index for metric data sets. Multimed Tool Appl, 21(1):9–33

    Article  Google Scholar 

  22. Dorigo M, Stützle T (2004) Ant colony optimization. MIT, Cambridge, MA

    Book  MATH  Google Scholar 

  23. Doulkeridis C, Vlachou A, Kotidis Y, Vazirgiannis M (2007) Peer-to-peer similarity search in metric spaces. In: Koch C, Gehrke J, Garofalakis MN, Srivastava D, Aberer K, Deshpande A, Florescu D, Chan CY, Ganti V, Kanne CC, Klas W, Neuhold EJ (eds) Proceedings of 33rd international conference on very large data bases (VLDB 2007), 23–27 Sept 2007, University of Vienna. ACM, Austria, pp 986–997

    Google Scholar 

  24. Falchi F, Gennaro C, Zezula P (2007) A content-addressable network for similarity search in metric spaces. In:Databases, information systems, and peer-to-peer computing. International workshops, DBISP2P 2005/2006, Trondheim, Norway, 28–29 August 2005, Seoul, Korea, 11 Sept 2006. Revised selected papers. Lecture notes in computer science, vol 4125. Springer, August 2007, pp 98–110

    Google Scholar 

  25. Gennaro C, Mordacchini M, Orlando S, Rabitti F (2007) MRoute: A peer-to-peer routing index for similarity search in metric spaces. In: Proceedings of the 5th international workshop on databases, information systems and peer-to-peer computing (DBISP2P 2007). VLDB Endowment, pp 1–12, September 2007

    Google Scholar 

  26. Gershenson C, Heylighen F (2005) How can we think the complex? In: Richardson K (ed) Managing organizational complexity: philosophy, theory and application, chap 3, pp 47–61. Information Age Publishing

    Google Scholar 

  27. Granovetter M (May 1973) The strength of week ties. Am J Sociol 78(6):1360–1380.

    Article  Google Scholar 

  28. Heylighen F (2001) The Science of Self-organization and Adaptivity, in: Kiel LD (ed) Knowledge Management, Organizational Intelligence and Learning, and Complexity, in: The Encyclopedia of Life Support Systems ((EOLSS), (Eolss Publishers, Oxford). [http://www.eolss.net]

    Google Scholar 

  29. Holland JH (1992) Adaptation in natural and artificial systems. MIT, Cambridge, MA, USA

    Google Scholar 

  30. Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Data Base Syst (TODS 2005) 30(2):364–397

    Google Scholar 

  31. Johnson S (2002) Emergence: the connected lives of ants, brains, cities, and software. Scribner, September 2002

    Google Scholar 

  32. Kagal L, Cost S, Finin T, Peng Y (2001) A framework for distributed trust management. In: Proceedings of IJCAI-01 workshop on autonomy, delegation and control, Seattle, August 6, 2001

    Google Scholar 

  33. Linari A, Patella M (2007) Metric overlay networks: processing similarity queries in p2p databases. In: Proceedings of the 5th international workshop on databases, information systems and peer-to-peer computing (DBISP2P 2007). VLDB Endowment

    Google Scholar 

  34. Mahmoud Q (2007) Cognitive networks: toward self-aware networks. Wiley-Interscience

    Google Scholar 

  35. Manjunath B, Salembier P, Sikora T (eds)(2002) Introduction to MPEG-7:multimedia content description interface. Wiley, New York, NY, USA

    Google Scholar 

  36. Michlmayr E (2007) Ant algorithms for self-organization in social networks. PhD thesis, TU Wien, May 2007

    Google Scholar 

  37. Milgram S (1967) The small world problem. Psychol Today 2(1):60–67

    MathSciNet  Google Scholar 

  38. Nicolis G, Prigogine I (1977) Self-organization in nonequilibrium systems. Wiley, New York

    MATH  Google Scholar 

  39. Novak D, Zezula P (2006) M-Chord: a scalable distributed similarity search structure. In: Proceedings of first international conference on scalable information systems (INFOSCALE 2006). IEEE Computer Society, Hong Kong, May 30–1 June, pp 1–10

    Google Scholar 

  40. Prehofer C, Bettstetter C (2005) Self-organization in communication networks: principles and design paradigms. Commun Mag 43(7):78–85

    Article  Google Scholar 

  41. Ratnasamy S, Francis P, Handley M, Karp R, Schenker S (2001) A scalable content-addressable network. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2001). ACM, San Diego, CA, 27–31 August 2001, pp 161–172

    Google Scholar 

  42. Samet H (1984) The quadtree and related hierarchical data structures. ACM Comput Surv (CSUR 1984) 16(2):187–260

    Google Scholar 

  43. Samet H (2006) Foundations of multidimensional and metric data structures. The morgan kaufmann series in data management systems. Morgan Kaufmann

    MATH  Google Scholar 

  44. Sedmidubský J, Bartoň S, Dohnal V, Zezula P (2007) Querying similarity in metric social networks. In: Proceedings of the 1st international conference on network-based information systems (NBIS 2007), Regensburg, Germany, 3–7 September 2007. Lecture notes in computer science, vol 4658. Springer, pp 278–287

    Google Scholar 

  45. Sedmidubský J, Bartoň S, Dohnal V, Zezula P (2008) Adaptive approximate similarity searching through metric social networks. In: Proceedings of the 24th international conference on data engineering (ICDE 2008), Extended abstract, pp 1424–1426. IEEE Computer Society, Los Alamitos, CA

    Chapter  Google Scholar 

  46. Sedmidubský J, Bartoň S, Dohnal V, Zezula P (2008) A self-organized system for content-based search in multimedia. In: Proceedings of the IEEE international symposium on multimedia (ISM 2008). IEEE Computer Society, Los Alamitos, CA 90720-1314, pp 322–327

    Google Scholar 

  47. Shepard RN (1987) Toward a universal law of generalization for psychological science. Science 237(4820):1317–1323

    Article  MATH  MathSciNet  Google Scholar 

  48. Stoica I, Morris R, Karger DR, Kaashoek FM, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2001). ACM, San Diego, CA, 27–31 August 2001, pp 149–160

    Google Scholar 

  49. Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement (IMC 2006). ACM, New York, NY, USA, pp 189–202

    Google Scholar 

  50. Sun YL, Han Z, Yu W, Liu KJR (2006) A trust evaluation framework in distributed networks: Vulnerability analysis and defense against attacks. In: Proceedings of 25th IEEE international conference on computer communications. Joint conference of the IEEE computer and communications societies (INFOCOM 2006), 23–29 April 2006, IEEE, Barcelona, Catalunya, Spain, pp 230–236

    Google Scholar 

  51. Tang C, Xu Z, Dwarkadas S (2003) Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 2003). ACM, New York, NY, USA, pp 175–186

    Google Scholar 

  52. Tanin E, Harwood A, Samet H (2005) A distributed quadtree index for peer-to-peer settings. In: Proceedings of the 21st international conference on data engineering (ICDE 2005), 5–8 April 2005, IEEE Computer Society, Tokyo, Japan, pp 254–255

    Google Scholar 

  53. Treherne J, Foster W (August 1981) Group transmission of predator avoidance behaviour in a marine insect: the trafalgar effect. Anim Behav 29(3):911–917

    Article  Google Scholar 

  54. Uhlmann JK (1991) Satisfying general proximity or similarity queries with metric trees. Inform Process Lett 40(4):175–179

    Article  MATH  Google Scholar 

  55. Wasserman S, Faust K, Iacobucci D (November 1994) Social network analysis : methods and applications (structural analysis in the social sciences). Cambridge University Press

    Google Scholar 

  56. Weikum G, Mönkeberg A, Hasse C, Zabback P (2002) Self-tuning database technology and information services: from wishful thinking to viable engineering. In: 28th international conference on very large databases (VLDB 2002). Morgan Kaufmann, Hongkong, China, pp 20–31

    Google Scholar 

  57. Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th annual ACM symposium on discrete algorithms (SODA 1993). ACM, Austin, TX, USA, 25–27 January 1993, pp 311–321

    Google Scholar 

  58. Zezula P, Amato G, Dohnal V, Batko M (2005) Similarity search: the metric space approach, vol 32. Advances in database systems. Springer, New York, NY, USA

    Google Scholar 

Download references

Acknowledgements

Partially supported by the EU IST FP6 project 045128 (SAPIR), the Czech Science Foundation projects 201/07/P240 and 102/05/H050.

Author information

Authors and Affiliations

  1. Conservatoire National des Arts et Metiers, CC 432292, Rue Saint-Martin, 75141, Paris, Cedex 03, France

    Stanislav Barton

  2. Faculty of informatics, Masaryk University, Botanicka 68a, 60200, Brno, Czech Republic

    Vlastislav Dohnal, Jan Sedmidubsky & Pavel Zezula

Authors
  1. Stanislav Barton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vlastislav Dohnal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Sedmidubsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pavel Zezula
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vlastislav Dohnal .

Editor information

Editors and Affiliations

  1. Scientific Network for Innovation &, Machine Intelligence Research Labs (MIR), Auburn, 98071-2259, U.S.A.

    Ajith Abraham

  2. Fac. Computers & Information, Cairo University, Ahmed Zewal Street 5, Giza, 12613, Egypt

    Aboul-Ella Hassanien

  3. Dept. Computer Science, Technical University Ostrava, Tr. 17. Listopadu 15, Ostrava, 708 33, Czech Republic

    Vaclav Sná¿el

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London Limited

About this chapter

Cite this chapter

Barton, S., Dohnal, V., Sedmidubsky, J., Zezula, P. (2010). Toward Self-Organizing Search Systems. In: Abraham, A., Hassanien, AE., Sná¿el, V. (eds) Computational Social Network Analysis. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84882-229-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-229-0_3

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-228-3

  • Online ISBN: 978-1-84882-229-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation