Pub Date : 2013-10-08DOI: 10.1109/CASoN.2013.6622604
M. Graña, I. Ruiz
The paper presents several novel ideas on how to understand social interaction as an intelligent computing phenomena, proposing a taxonomy of social systems regarding intelligent behavior that may be useful to set the stage. A key distinction between unconscious and subconscious computing is drawn. Two instances of systems, which are in diverse stages of development, showing subconscious social intelligent computing are discussed.
{"title":"Instances of subconscious social intelligent computing","authors":"M. Graña, I. Ruiz","doi":"10.1109/CASoN.2013.6622604","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622604","url":null,"abstract":"The paper presents several novel ideas on how to understand social interaction as an intelligent computing phenomena, proposing a taxonomy of social systems regarding intelligent behavior that may be useful to set the stage. A key distinction between unconscious and subconscious computing is drawn. Two instances of systems, which are in diverse stages of development, showing subconscious social intelligent computing are discussed.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348637","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}
Pub Date : 2013-10-08DOI: 10.1109/CASoN.2013.6622607
Gustavo Freitas, C. Costa, J. Barbosa, R. Righi, A. Yamin
Nowadays, we can observe that finding answers on social networks is a hard and time-consuming task. The main contribution of this article is the creation of a model and algorithm that allows users to find answers to their questions using a spontaneous social network called Mingle. This algorithm uses the Mingle ontology-based knowledge base to find expert users. To achieve this, two important steps are taken: Mingle ontology is updated to support user-oriented expertise and a detailed model is created for the given algorithm. This model was created considering other three similar applications and algorithms. Moreover, we used a semantic web framework. In the end, an evaluation using real-life scenarios is applied to evaluate if the created algorithm meets the initial goals.
{"title":"Expert user discovery in a spontaneous social network an approach using knowledge retrieval","authors":"Gustavo Freitas, C. Costa, J. Barbosa, R. Righi, A. Yamin","doi":"10.1109/CASoN.2013.6622607","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622607","url":null,"abstract":"Nowadays, we can observe that finding answers on social networks is a hard and time-consuming task. The main contribution of this article is the creation of a model and algorithm that allows users to find answers to their questions using a spontaneous social network called Mingle. This algorithm uses the Mingle ontology-based knowledge base to find expert users. To achieve this, two important steps are taken: Mingle ontology is updated to support user-oriented expertise and a detailed model is created for the given algorithm. This model was created considering other three similar applications and algorithms. Moreover, we used a semantic web framework. In the end, an evaluation using real-life scenarios is applied to evaluate if the created algorithm meets the initial goals.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117065609","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}
Pub Date : 2013-10-08DOI: 10.1109/CASoN.2013.6622600
M. Radvanský, M. Kudelka, Z. Horak, V. Snás̃el
Visualization is an important part of network analysis. It helps find features of the network that are not easily identifiable. Visualization dynamics of the network is very useful. Evolution of network and communities during time can help us understand social mechanisms behind the network. Visualization of the dynamics is not an easy task. There are several issues that have to be solved for correct visualization. We present our approach to the visualization of weighted networks based on Sammon's projection and linear approximation. Our goal in this paper is to introduce a method for visualizing dynamics of the social network. Results are illustrated by several 3D layout snapshots of the co-authorship network extracted from the DBLP database.
{"title":"Visualization of social network dynamics using Sammon's projection","authors":"M. Radvanský, M. Kudelka, Z. Horak, V. Snás̃el","doi":"10.1109/CASoN.2013.6622600","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622600","url":null,"abstract":"Visualization is an important part of network analysis. It helps find features of the network that are not easily identifiable. Visualization dynamics of the network is very useful. Evolution of network and communities during time can help us understand social mechanisms behind the network. Visualization of the dynamics is not an easy task. There are several issues that have to be solved for correct visualization. We present our approach to the visualization of weighted networks based on Sammon's projection and linear approximation. Our goal in this paper is to introduce a method for visualizing dynamics of the social network. Results are illustrated by several 3D layout snapshots of the co-authorship network extracted from the DBLP database.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129386470","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}
Pub Date : 2013-10-08DOI: 10.1109/CASoN.2013.6622596
H. Ishibuchi, Takahiko Sudo, Koichiro Hoshino, Y. Nojima
Evolution of cooperative strategies was examined for spatial iterated prisoner's dilemma (IPD) games in many studies. Lattices and networks were frequently used as spatial structures where a single player was assigned to each node. It was demonstrated that spatial structures were beneficial for the evolution of cooperation. In this paper, we examine the effect of the choice of a network structure on the evolution of cooperation in a network-based spatial IPD game. We use a variety of networks. They are different from each other in the network size and the number of edges from each node. Some networks have edges between randomly selected nodes while edges of other networks are only between adjacent nodes. Memory-based lookup tables are used as strategies of players. Computational experiments are performed under two settings with respect to the noise in action selection. One is a noise-free setting where each player always chooses the suggested action by its strategy. The other is a noisy setting where each player chooses a different action from the suggested one with a pre-specified error probability. We examine the effects of the network size, the number of edges, the number of opponents and the addition of randomly specified edges as well as the memory length on the evolution of cooperative strategies.
{"title":"Evolution of cooperative strategies for iterated prisoner's dilemma on networks","authors":"H. Ishibuchi, Takahiko Sudo, Koichiro Hoshino, Y. Nojima","doi":"10.1109/CASoN.2013.6622596","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622596","url":null,"abstract":"Evolution of cooperative strategies was examined for spatial iterated prisoner's dilemma (IPD) games in many studies. Lattices and networks were frequently used as spatial structures where a single player was assigned to each node. It was demonstrated that spatial structures were beneficial for the evolution of cooperation. In this paper, we examine the effect of the choice of a network structure on the evolution of cooperation in a network-based spatial IPD game. We use a variety of networks. They are different from each other in the network size and the number of edges from each node. Some networks have edges between randomly selected nodes while edges of other networks are only between adjacent nodes. Memory-based lookup tables are used as strategies of players. Computational experiments are performed under two settings with respect to the noise in action selection. One is a noise-free setting where each player always chooses the suggested action by its strategy. The other is a noisy setting where each player chooses a different action from the suggested one with a pre-specified error probability. We examine the effects of the network size, the number of edges, the number of opponents and the addition of randomly specified edges as well as the memory length on the evolution of cooperative strategies.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130610599","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：