Scheduled Maintenance on August 31st, 2016:
IEEE Xplore will undergo system maintenance from 1:00 - 3:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Computational Aspects of Social Networks, 2009. CASON '09. International Conference on

Date 24-27 June 2009

Filter Results

Displaying Results 1 - 25 of 35
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (357 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (110 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (174 KB)
    Freely Available from IEEE
  • Message from Chairs

    Publication Year: 2009, Page(s):viii - ix
    Request permission for commercial reuse | PDF file iconPDF (104 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009, Page(s):x - xi
    Request permission for commercial reuse | PDF file iconPDF (147 KB)
    Freely Available from IEEE
  • International Scientific Committee/Reviewers

    Publication Year: 2009, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • Social Influence Models Based on Starbucks Networks

    Publication Year: 2009, Page(s):3 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3725 KB) | HTML iconHTML

    Starbucks coffee shops have been spread rapidly and widely all over the world, which implies that there may be diffusive powers among them and thus can be represented as social networks. In particular, the spreading speed of Starbuck Korea was at record levels. In this paper, we constructed social networks using the information about Starbuck Korea (ex. latitude and longitude of each Starbucks sto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Random Network Generator with Finely Tunable Clustering Coefficient for Small-World Social Networks

    Publication Year: 2009, Page(s):10 - 17
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    Many social networks share two generic distinct features: power law distributions of degrees and a high clustering. In some cases, it is difficult to obtain the structure information of real networks. Network generators provide a way to generate test networks for simulation. We present a random network generator to generate test networks with prescribed power law distributions of degrees and a fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a Matrix Decomposition for Clustering Data

    Publication Year: 2009, Page(s):18 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    There are many search engines in the web and when asked, they return a long list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present how usage of Matrix Decomposition (Singular Value Decomposition (SVD) and Nonnegative Matrix Fac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Performance of Centrality Calculation in Social Networks

    Publication Year: 2009, Page(s):24 - 31
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    To analyze large social networks a lot of effort and resources are usually required. Network analysis offers many centrality measures that are successfully utilized in the process of investigating the social network characteristics. One of them is node position, which can be used to assess the importance of a given node within either the whole social network or the smaller subgroup. Three algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extended Generalized Blockmodeling for Compound Communities and External Actors

    Publication Year: 2009, Page(s):32 - 39
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (987 KB) | HTML iconHTML

    Some social communities evident their own unique internal structure. In the paper we consider social communities composed of several cohesive subgroups which we call compound communities. For such communities, an extended generalized blockmodeling is proposed, taking into account the structure of compound communities and relations with external actors. Using the extension, the community protection... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enriching Trust Prediction Model in Social Network with User Rating Similarity

    Publication Year: 2009, Page(s):40 - 47
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (499 KB) | HTML iconHTML

    Trust management is an increasingly important issue in large social networks, where the amount of data is too extensive to be analysed by ordinary users. Hence there is an urgent need for research aiming at building automated systems that can support users in making their decisions concerning trust. This work is a preliminary implementation of selected ideas described in our previous research prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Synergies between Online Social Networking, Face Recognition and Interactive Robotics

    Publication Year: 2009, Page(s):48 - 56
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (451 KB) | HTML iconHTML

    This paper explores the intersection of three areas: interactive robots, face recognition, and online social networks, by presenting and discussing an implemented real-world system that combines all three, a ldquoFaceBotsrdquo robot. Our robot is a mobile robot with face recognition, natural language dialogue, as well as mapping capabilities. The robot is also equipped with a social database conta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social Network - An Autonomous System Designed for Radio Recommendation

    Publication Year: 2009, Page(s):57 - 64
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB) | HTML iconHTML

    This paper describes the functions of a system proposed for the music tube recommendation from social network data base. Such a system enables the automatic collection, evaluation and rating of music critics, the possibility to rate music tube by auditors and the recommendation of tubes depended from auditor's profiles in form of regional internet radio. First, the system searches and retrieves pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Space-Based Layout Algorithm for the Drawing of Co-citation Networks

    Publication Year: 2009, Page(s):65 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB) | HTML iconHTML

    We present in this paper a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties which are often valuable to be visualized. In general, these networks are pruned with a network scaling algorithm, then visualized using a drawing algorithm. However, typical drawing algorithms do not work properly, espec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social Group Identification and Clustering

    Publication Year: 2009, Page(s):73 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    Some methods for object group identification applicable for social group identification are compared. We suppose that people are characterized by their actions, for example the deputies are characterized by their voting habits. We are interested in binary data analysis (e.g. the result of voting is yes or not). The dataset consisting of the roll-call votes records in the Russian parliament in 2004... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social Aspects of Web Page Contents

    Publication Year: 2009, Page(s):80 - 87
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2405 KB) | HTML iconHTML

    In this paper we try to consider a Web page as information with social aspects. Each Web page is the result of invisible social interaction. This interaction between different groups of people translates into a certain unification of Web page creation. External signs of this unification are the features of the Web page, that meets the userpsilas expectations. Through analysis of the features, we c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social Network Signatures: A Framework for Re-identification in Networked Data and Experimental Results

    Publication Year: 2009, Page(s):88 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB) | HTML iconHTML

    Data on large dynamic social networks, such as telecommunications networks and the Internet, are pervasive. However, few methods conducive to efficient large-scale analysis exist. In this paper, we focus on the task of re-identification. Re-identification in the context of dynamic networks is a matching problem that involves comparing the behavior of networked entities across two time periods. Pri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review-Based Ranking of Wikipedia Articles

    Publication Year: 2009, Page(s):98 - 104
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB) | HTML iconHTML

    Wikipedia, the largest encyclopedia on the Web, is often seen as the most successful example of crowdsourcing. The encyclopedic knowledge it accumulated over the years is so large that one often uses search engines, to find information in it. In contrast to regular Web pages, Wikipedia is fairly structured, and articles are usually accompanied with history pages, categories and talk pages. The met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting Communities in Large Networks by Iterative Local Expansion

    Publication Year: 2009, Page(s):105 - 112
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    Much structured data of scientific interest can be represented as networks, where sets of nodes or vertices are joined together in pairs by links or edges. Although these networks may belong to different research areas, there is one property that many of them do have in common: the network community structure, which means that there exists densely connected groups of vertices, with only sparser co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Architecture to Facilitate Membership and Service Management in Trusted Communities

    Publication Year: 2009, Page(s):113 - 118
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (699 KB) | HTML iconHTML

    Ubiquitous connectivity today allows many users to remain connected regardless of location with various kinds of communities. This paper studies challenges in building trusted communities that encompass both new users as well as users already possessing credentials from other well known connectivity providers, federations, content providers and social networks. We postulate that trusted communitie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Graph Descriptors of E-content Unit Organisation and Controlling Features

    Publication Year: 2009, Page(s):119 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    The e-learning databases content description methods, for presentation and distribution, were introduced in many works (as in. IMS and Common Cartridge action), for standardisation (SCORM) and distribution platforms for authoring systems (MOODLE, MAMS). The personalization processes of training units structure finding is still an investigations area. The specifications like IMS LD supported by OUM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sentence Factorization for Opinion Feature Mining

    Publication Year: 2009, Page(s):129 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (143 KB) | HTML iconHTML

    Opinion mining has tremendous potentials in extracting valuable information and experience from individuals on products and services. In particular, product features extraction and sentiment scoring on extracted features are fundamental steps. Opinion knowledge extraction often involves extensive application of natural language processing, manual labeling and machine learning methods.In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.