• DocumentCode
    2520121
  • Title

    Supporting Network Formation through Mining under Privacy Constraints

  • Author

    Skopik, Florian ; Schall, Daniel ; Dust, Schahram

  • Author_Institution
    Distrib. Syst. Group, Vienna Univ. of Technol., Vienna, Austria
  • fYear
    2010
  • fDate
    19-23 July 2010
  • Firstpage
    105
  • Lastpage
    108
  • Abstract
    Single professionals and small companies come together and form virtual communities to compete with global players. In these collaboration networks, the actual business partners are discovered and alliances formed on demand. However, it is impossible for single members to keep track of the dynamics in large-scale networks. With the wide adoption of service-oriented architectures (SOA), interactions between partners have become observable. Monitoring collaborations enables the inference of social relations and the identification of successful partner compositions. Measuring the quality of social relations, such as the degree of trust based on the success of past interactions, are a powerful means to support the formation of alliances. However, by applying monitoring, also privacy concerns arise. In this paper we deal with concepts and tools to support group formations. We consider the trade-off between the benefits of sharing personal profiles and accounting for privacy concerns of the individual network members.
  • Keywords
    Web services; data privacy; software architecture; collaboration networks; group formations; mining; privacy constraints; service-oriented architectures; supporting network formation; Artificial neural networks; Collaboration; Gallium; Joints; Measurement; Privacy; Service oriented architecture; group formation; interaction monitoring; privacy issues; service-centric collaborations; trust inference;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applications and the Internet (SAINT), 2010 10th IEEE/IPSJ International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-7526-1
  • Electronic_ISBN
    978-0-7695-4107-5
  • Type

    conf

  • DOI
    10.1109/SAINT.2010.10
  • Filename
    5598166