发布求助
文献互助 智能选刊 最新文献

2015 Second European Network Intelligence Conference最新文献

筛选
英文 中文
Using Visual Stability to Support Search Efficiency and User Experience in Dynamic Graph Drawings 使用视觉稳定性来支持动态图形绘图的搜索效率和用户体验
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.29
Alfredo Ramos Lezama, Tilman Göhnert, Irene-Angelica Chounta, H. Hoppe
{"title":"Using Visual Stability to Support Search Efficiency and User Experience in Dynamic Graph Drawings","authors":"Alfredo Ramos Lezama, Tilman Göhnert, Irene-Angelica Chounta, H. Hoppe","doi":"10.1109/ENIC.2015.29","DOIUrl":"https://doi.org/10.1109/ENIC.2015.29","url":null,"abstract":"In this paper, we present a set of algorithms to compute a foresighted graph layout. We aim to produce a dynamic graph drawing that allows the users to track actors in a dynamic social network, supporting a satisfying user experience along with an efficient visual search and recognition of elements. The drawings produced by the algorithms were evaluated through a study, which combined the use of questionnaires, an eye-tracking device and a model we developed to measure the visual stability of dynamic graph drawings. The results suggest dynamic graph drawings achieving visual stability by placing multiple actors in the same position are confusing and are not efficient in the visual search. On the contrary, introducing a restriction to prevent too many actors to occupy the same position produces the desired drawing.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"R-28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126628141","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}
引用次数: 1
A Greedy Strategy Link Clustering Method Based on AP 一种基于AP的贪婪策略链路聚类方法
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.26
Liming Song, Lan Huang, Yan Wang, Lichao Song
{"title":"A Greedy Strategy Link Clustering Method Based on AP","authors":"Liming Song, Lan Huang, Yan Wang, Lichao Song","doi":"10.1109/ENIC.2015.26","DOIUrl":"https://doi.org/10.1109/ENIC.2015.26","url":null,"abstract":"With the emergence of link clustering method (LC), research on link community detection has become an important topic in the overlapping community detection. After calculation of link similarity, LC method divides the community through hierarchical clustering and partition density method. However, it's possible that the hierarchical clustering would fall into the local minimum, and that the segmentation density method will cause too small community division results. To solve those problems, in this paper, Affinity Propagation (AP) clustering method is used to replace the hierarchical clustering method. Then combined with the greedy expansion module strategy to improve the LC method. And then, a greedy strategy link clustering method based on AP(ALC) is proposed. Through comparing with LC method, CPM method and iLCD method with experiments on three real-world datasets, ALC is proved to have better performance on evaluations.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116466454","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}
引用次数: 0
Survivability Aspects of Tree Construction for Overlay Multicasting with Dual Homing Architecture 双寻的覆盖组播树型结构的生存性
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.15
Wojciech Kmiecik
{"title":"Survivability Aspects of Tree Construction for Overlay Multicasting with Dual Homing Architecture","authors":"Wojciech Kmiecik","doi":"10.1109/ENIC.2015.15","DOIUrl":"https://doi.org/10.1109/ENIC.2015.15","url":null,"abstract":"In this paper, we focus on the topic of construction of multicast trees in overlay networks. Moreover, we address our problem with the survivability assumptions and propose several scenarios that can be applied to provide the required protection. We perform numerical experiments to compare proposed survivability scenarios and investigate the problem of providing survivability to both static and dynamic types of overlay network. Our studies show that the additional survivability requirements related to the proposed tree construction strategies do not have a substantial impact on the overlay multicasting system expressed as the overall delay.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127371156","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}
引用次数: 0
Analysis of User Roles and the Emergence of Themes in Discussion Forums 用户角色分析与论坛主题的产生
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.24
Tobias Hecking, Irene-Angelica Chounta, H. Hoppe
{"title":"Analysis of User Roles and the Emergence of Themes in Discussion Forums","authors":"Tobias Hecking, Irene-Angelica Chounta, H. Hoppe","doi":"10.1109/ENIC.2015.24","DOIUrl":"https://doi.org/10.1109/ENIC.2015.24","url":null,"abstract":"This work explores network analysis methods for the analysis of emergent themes as well as types of users in discussion forums. The paper provides both, a description of the analysis approach and its application as a case study. To that end, keywords are extracted from forum threads and then linked to the forum users resulting in a bipartite network based on their activity in discussion threads. Applying bipartite clustering on those networks, groups of users with common interest in themes can be identified as well as groups of related keywords based on their common relations to users. As a case study, the approach is applied to a discussion forum of a Courser a MOOC. The results reveal some interesting patterns and phenomena of thematic development that take place in such large scale learning courses.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122313883","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}
引用次数: 10
TVG-OSN: A Time Varying Graph Model for Online Social Network Dynamics Analysis TVG-OSN:在线社交网络动态分析的时变图模型
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.11
B. Birregah, Omar Jaafor
{"title":"TVG-OSN: A Time Varying Graph Model for Online Social Network Dynamics Analysis","authors":"B. Birregah, Omar Jaafor","doi":"10.1109/ENIC.2015.11","DOIUrl":"https://doi.org/10.1109/ENIC.2015.11","url":null,"abstract":"Online social networks like Facebook, Twitter, Linked In and YouTube have become major platforms for sharing content, socialization, e-commerce, security monitoring, etc. Numerous researchers are devoted to studying these platforms that are modeled from a variety of perspectives. Hence, depending on the research, online social networks are modeled using different annotations that often refer to the same concepts. Many of these models ignore or discretize the temporal dimension of social networks leading to a loss of temporal information. Other models consider communications on these platforms to be instantaneous overlooking the delay between its initiation and processing, or omit the representation of identity maps between nodes at different times. Also, most models do not allow for the representation of the states of social network actors at different times. We provide in this paper a simple temporal graph model for online social networks (TVG-OSN) that fully accounts for their dynamics in addition to a new definition of the latency function between users.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"16 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120813806","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}
引用次数: 2
Scalable Method for Information Spread Control in Social Network 社会网络中信息传播控制的可扩展方法
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.23
Michal Wojtasiewicz, M. Kłopotek, K. Ciesielski
{"title":"Scalable Method for Information Spread Control in Social Network","authors":"Michal Wojtasiewicz, M. Kłopotek, K. Ciesielski","doi":"10.1109/ENIC.2015.23","DOIUrl":"https://doi.org/10.1109/ENIC.2015.23","url":null,"abstract":"In this paper scalable and parallelized method for cluster analysis based on random walks is presented. The aim of the algorithm introduced in this paper is to detect dense sub graphs (clusters) and sparse sub graphs (bridges) which are responsible for information spreading among found clusters. The algorithm is sensitive to vertices assignment uncertainty. It distinguishes groups of nodes which form sparse clusters. These groups are mostly located in places crucial for information spreading so one can control signal propagation between separated dense sub graphs by using algorithm provided in this work. Authors have also proposed new coefficient which measures quality of given clustering in a sense of an information spread control between clusters. Measure presented in this paper can be used for determining quality of whole partitioning or a single bridge.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116505055","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}
引用次数: 0
Clustering Social Networks Using Competing Ant Hives 利用竞争蚁巢聚类社会网络
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.18
Pascal Held, Alexander Dockhorn, Benjamin Krause, R. Kruse
{"title":"Clustering Social Networks Using Competing Ant Hives","authors":"Pascal Held, Alexander Dockhorn, Benjamin Krause, R. Kruse","doi":"10.1109/ENIC.2015.18","DOIUrl":"https://doi.org/10.1109/ENIC.2015.18","url":null,"abstract":"Methods for clustering static graphs cannot always be transferred straight forward to dynamic scenarios. A typical approach is to reduce the number of updates by reusing results of previous iterations. But are there natural ways to implement dynamic graph clustering? This paper proposes a method, which was derived by graph based ant colony algorithms. Similar to other clustering algorithms, multiple ant colonies are competing for the available nodes. Each hive creates ants, which will explore nearby graph structures and drop hive-specific pheromones on visited nodes. Over time, hives will collect nodes and will be relocated to the center of all collected nodes. In case of dynamic graph clustering, pheromone values can be reused in consecutive iterations. Our evaluation revealed that the proposed algorithm can lead to results on a par with the k-median algorithm and performs worse than Louvain clustering. However competing ant hives have the advantage of implicit noise detection, which comes at the cost of longer computation times. This can make it a suitable choice for certain clustering tasks.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116225926","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}
引用次数: 1
Towards Finding an Effective Uniform and Single Point Crossover Balance for Optimization of Elastic Optical Networks 探讨弹性光网络优化中有效的均匀单点交叉平衡
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.14
M. Przewozniczek
{"title":"Towards Finding an Effective Uniform and Single Point Crossover Balance for Optimization of Elastic Optical Networks","authors":"M. Przewozniczek","doi":"10.1109/ENIC.2015.14","DOIUrl":"https://doi.org/10.1109/ENIC.2015.14","url":null,"abstract":"The new promising technologies in the network communication field bring the possibilities of faster and more safe information sending. However, the new technologies bring up new computation problems as well. The network flow may be organized in a better way with respect to different criteria. It is common that such problems are hard not only because of their size, but also due to their NP-complete or NP-hard nature. The Genetic Algorithms are commonly known and widely used tools, which allow to effectively solve such problems. It is usual that a Genetic Algorithm is adjusted to the solved problem. The adjustments may also take into consideration the type of crossover operator used, which is one of the most primary genetic operators. Therefore, this paper takes into consideration the NP-hard Routing and Spectrum Allocation with Joint Any cast and Unicast problem and presents the results of extensive research performed to check the influence of crossover type on the overall method effectiveness.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126709936","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
Crawling Online Social Networks 抓取在线社交网络
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.10
Fredrik Erlandsson, R. Nia, Martin Boldt, H. Johnson, S. F. Wu
{"title":"Crawling Online Social Networks","authors":"Fredrik Erlandsson, R. Nia, Martin Boldt, H. Johnson, S. F. Wu","doi":"10.1109/ENIC.2015.10","DOIUrl":"https://doi.org/10.1109/ENIC.2015.10","url":null,"abstract":"Researchers put in tremendous amount of time and effort in order to crawl the information from online social networks. With the variety and the vast amount of information shared on online social networks today, different crawlers have been designed to capture several types of information. We have developed a novel crawler called SINCE. This crawler differs significantly from other existing crawlers in terms of efficiency and crawling depth. We are getting all interactions related to every single post. In addition, are we able to understand interaction dynamics, enabling support for making informed decisions on what content to re-crawl in order to get the most recent snapshot of interactions. Finally we evaluate our crawler against other existing crawlers in terms of completeness and efficiency. Over the last years we have crawled public communities on Facebook, resulting in over 500 million unique Facebook users, 50 million posts, 500 million comments and over 6 billion likes.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130778194","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}
引用次数: 25
Aatish - A New Profile-Based Recommendation Services for Mobile Telecom Network Subscribers Aatish——一种新的基于个人资料的移动通信网络用户推荐服务
2015 Second European Network Intelligence Conference Pub Date : 2015-09-21 DOI: 10.1109/ENIC.2015.32
M. Saravanan, P. Manoj, G. Smitha, V. Lakshmi
{"title":"Aatish - A New Profile-Based Recommendation Services for Mobile Telecom Network Subscribers","authors":"M. Saravanan, P. Manoj, G. Smitha, V. Lakshmi","doi":"10.1109/ENIC.2015.32","DOIUrl":"https://doi.org/10.1109/ENIC.2015.32","url":null,"abstract":"Current mobile telecom networks generate massive amounts of subscribers' data consisting of observations on duration of call, time of call, type of call, plans subscribed and other details in addition to network data. Due to the ever increasing degree in complexity of understanding behavioural pattern of subscribers in networks, coupled with specific constraints related to subscribers' preferences, the traditional recommendation approaches are not efficient in meeting customer demands. A new recommendation paradigm is required that uses techniques that exploit user-specific information based on time, location, recent interest, etc., rather than common techniques, to prioritize recommendation. Our work presents the design and specification of Aatish, a profile-based recommendation system as a solution to increase the probability of acceptance of recommendations by individuals. In our approach, recommendation services are modelled using a newly proposed policy-based engine that combines information from subscriber's behavioural aspects of Mobile Telecom Networks (MTN) and Social Media (SM) inputs. Services are also associated with requirements, that is, set of propositions that characterize the execution environment of the service. The architecture of Aatish illustrates policy enhancement that takes into account the context as well as content-aware situations and user preferences that can impact the performances and functionalities of efficient recommendation system. Our study starts by extracting user information from CDRs and social media to generate sequences of recommendations. After observing response from users for the recommendations, appropriate actions are selected, re-ranked and recommended so that the engendered recommendations match recent needs of the users. Moreover, subscriber's ranking preferences have been derived based on the behavioural pattern of users in terms of their mobile phone usage (Recency, Frequency, Monetary) for the benefit of improving the loyalty scores.","PeriodicalId":231985,"journal":{"name":"2015 Second European Network Intelligence Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122345989","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书