2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)最新文献_第2页

Familiar Strangers detection in online social networks 在线社交网络中的熟悉陌生人检测

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2500233

Charles Perez, B. Birregah, Marc Lemercier

{"title":"Familiar Strangers detection in online social networks","authors":"Charles Perez, B. Birregah, Marc Lemercier","doi":"10.1145/2492517.2500233","DOIUrl":"https://doi.org/10.1145/2492517.2500233","url":null,"abstract":"Online social networks and microblogging platforms have collected a huge number of users this last decade. On such platforms, traces of activities are automatically recorded and stored on remote servers. Open data deriving from these traces of interactions represent a major opportunity for social network analysis and mining. This leads to important challenges when trying to understand and analyse these large-scale networks better. Recently, many sociological concepts such as friendship, community, trust and reputation have been transposed and integrated into online social networks. The recent success of mobile social networks and the increasing number of nomadic users of online social networks can contribute to extending the scope of these concepts. In this paper, we transpose the notion of the Familiar Stranger, which is a sociological concept introduced by Stanley Milgram. We propose a framework particularly adapted to online platforms that allows this concept to be defined. Various application fields may be considered: entertainment, services, homeland security, etc. To perform the detection task, we address the concept of familiarity based on spatio-temporal and attribute similarities. The paper ends with a case study of the well-known microblogging platform Twitter.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129183444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A dissemination-based mobile web application framework for juvenile ideopathic arthritis patients 基于传播的青少年关节炎患者移动web应用框架

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2500278

R. Kazi, R. Deters

{"title":"A dissemination-based mobile web application framework for juvenile ideopathic arthritis patients","authors":"R. Kazi, R. Deters","doi":"10.1145/2492517.2500278","DOIUrl":"https://doi.org/10.1145/2492517.2500278","url":null,"abstract":"Adopting mobile technologies in assisting healthcare is opening new possibilities in medical health domain through bringing a dramatic shift from conventional paper-based tracking to electronic tracking and evaluation system. Health information systems have the potential to offer greater improvement in collecting and accessing relevant information, disseminating data among health practitioners and patients in a reliable and secure manner with faster speed and analyzing them efficiently. In this paper we have proposed and implemented a prototypical client-server based health information framework that allows both clinicians and patients to send data to a centralized backend system database and have access to those data when needed. Our framework adopts mobile electronic pain diary named PInGO for juvenile idiopathic arthritis patients to report their health conditions to the clinicians. Our framework offers secure, reliable and fast dissemination and access of these data through leveraging the latest push-based Web technology and RESTful web services. From our preliminary experiment results it has been observed that data dissemination using RESTful web services within event-based publish-subscribe domain provides greater performance improvement comparing to traditional pull-based data dissemination over Web.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121404166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

MedCase: A template medical case store for case-based reasoning in medical decision support MedCase:用于医疗决策支持中基于案例的推理的模板医疗案例存储

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2500331

Hsien-Tseng Wang, A. Tansel

{"title":"MedCase: A template medical case store for case-based reasoning in medical decision support","authors":"Hsien-Tseng Wang, A. Tansel","doi":"10.1145/2492517.2500331","DOIUrl":"https://doi.org/10.1145/2492517.2500331","url":null,"abstract":"The early development of medical decision support systems (appeared as expert systems (ES)) mainly focused on, among others, rule-based reasoning (RBR) and decision table/tree (DT) methods as problem solving strategies. These efforts were novel at the time; however, as these methodologies applied to more complex situations, the construction of knowledge base (e.g. rules, cases and 'models') for specific problem solving tasks becomes difficult and time consuming. Remedies to these difficulties have been sought, aiming at better knowledge modeling, knowledge acquisition, and extending the problem solving paradigm to distributed architectures. Alternatively, case-based reasoning (CBR) provides a different problem solving paradigm. In CBR, the knowledge is seen as cases that contain explicit and implicit aspects of the knowledge for solving a problem. The CBR methodology works in a practical way, and the reasoning is based on recalled knowledge memory of solved cases. To alleviate the difficulty of knowledge (case) acquisition and construction, this paper presents a design of a template case store, called MedCase. MedCase utilizes the semantic web technologies and supports a distributed CBR system architecture. MedCase promotes an open and accessible architecture for common CBR tasks in a virtual Healthcare Enterprise environment. MedCase will also allow the construction and sharing of cases that facilitate the development of distributed CBR-based medical decision support systems.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124535126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Personality, movie preferences, and recommendations 个性、电影偏好和推荐

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2492572

J. Golbeck, Eric Norris

引用次数: 21

Community-based features for identifying spammers in Online Social Networks 用于识别在线社交网络中的垃圾邮件发送者的基于社区的功能

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2492567

S. Y. Bhat, M. Abulaish

{"title":"Community-based features for identifying spammers in Online Social Networks","authors":"S. Y. Bhat, M. Abulaish","doi":"10.1145/2492517.2492567","DOIUrl":"https://doi.org/10.1145/2492517.2492567","url":null,"abstract":"The popularity of Online Social Networks (OSNs) is often faced with challenges of dealing with undesirable users and their malicious activities in the social networks. The most common form of malicious activity over OSNs is spamming wherein a bot (fake user) disseminates content, malware/viruses, etc. to the legitimate users of the social networks. The common motives behind such activity include phishing, scams, viral marketing and so on which the recipients do not indent to receive. It is thus a highly desirable task to devise techniques and methods for identifying spammers (spamming accounts) in OSNs. With an aim of exploiting social network characteristics of community formation by legitimate users, this paper presents a community-based framework to identify spammers in OSNs. The framework uses community-based features of OSN users to learn classification models for identification of spamming accounts. The preliminary experiments on a real-world dataset with simulated spammers reveal that proposed approach is promising and that using community-based node features of OSN users can improve the performance of classifying spammers and legitimate users.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132480348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 90

Multi-objective restructuring in social networks 社会网络中的多目标重构

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2492660

R. Chulaka Gunasekara, K. Mehrotra, C. Mohan

引用次数: 2

Fixed points of graph peeling 图剥离不动点

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2492543

J. Abello, François Queyroi

引用次数: 16

ChurnVis: Visualizing mobile telecommunications churn on a social network with attributes ChurnVis:可视化带有属性的社交网络上的移动通信流失

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2500274

D. Archambault, N. Hurley, Cuong To Tu

引用次数: 7

Towards a faster network-centric subgraph census 迈向更快的以网络为中心的子图普查

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2492535

Pedro Paredes, P. Ribeiro

{"title":"Towards a faster network-centric subgraph census","authors":"Pedro Paredes, P. Ribeiro","doi":"10.1145/2492517.2492535","DOIUrl":"https://doi.org/10.1145/2492517.2492535","url":null,"abstract":"Determining the frequency of small subgraphs is an important computational task lying at the core of several graph mining methodologies, such as network motifs discovery or graphlet based measurements. In this paper we try to improve a class of algorithms available for this purpose, namely network-centric algorithms, which are based upon the enumeration of all sets of k connected nodes. Past approaches would essentially delay isomorphism tests until they had a finalized set of k nodes. In this paper we show how isomorphism testing can be done during the actual enumeration. We use a customized g-trie, a tree data structure, in order to encapsulate the topological information of the embedded subgraphs, identifying already known node permutations of the same subgraph type. With this we avoid redundancy and the need of an isomorphism test for each subgraph occurrence. We tested our algorithm, which we called FaSE, on a set of different real complex networks, both directed and undirected, showcasing that we indeed achieve significant speedups of at least one order of magnitude against past algorithms, paving the way for a faster network-centric approach.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124130007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 26

LookingGlass: A visual intelligence platform for tracking online social movements LookingGlass:一个追踪在线社交活动的视觉智能平台

2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) Pub Date : 2013-08-25 DOI: 10.1145/2492517.2500275

Nyunsu Kim, Sedat Gokalp, H. Davulcu, Mark Woodward

引用次数: 6