The evolution of the Web has allowed the generation of several platforms for collaborative work. One of the main contributors to these advances is the Open Source initiative, in which projects are boosted to a new level of interaction and cooperation that improves their software quality and reliability. In order to understand how the group of contributors interacts with the software under development, we propose a novel methodology that adapts Lotka-Volterra-based biological models used for host-parasite interaction. In that sense, we used the concept mutualism from social parasites. Preliminary results based on experiments on the Github collaborative platform showed that Open Source phenomena can be modeled as a mutualistic system, in terms of the evolution of the population of developers and repositories.
{"title":"Biological Mutualistic Models Applied to Study Open Source Software Development","authors":"Pablo Loyola, In-Young Ko","doi":"10.1109/WI-IAT.2012.228","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.228","url":null,"abstract":"The evolution of the Web has allowed the generation of several platforms for collaborative work. One of the main contributors to these advances is the Open Source initiative, in which projects are boosted to a new level of interaction and cooperation that improves their software quality and reliability. In order to understand how the group of contributors interacts with the software under development, we propose a novel methodology that adapts Lotka-Volterra-based biological models used for host-parasite interaction. In that sense, we used the concept mutualism from social parasites. Preliminary results based on experiments on the Github collaborative platform showed that Open Source phenomena can be modeled as a mutualistic system, in terms of the evolution of the population of developers and repositories.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122416945","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}
J. Domenech, B. D. L. Ossa, A. Pont, J. A. Gil, Milagros Martinez, A. Rubio
The prompt availability of up-to-date economic indicators is crucial to monitor the economy and to steer the design of policies for promoting business innovation and raising firm competitiveness. Economic indicators usually suffer important lags since they are commonly obtained from official databases or from interviews to a sample of agents, thus limiting the representative ness and usefulness of the information. In a context in which the presence of companies in the World Wide Web is almost an obligation to succeed, corporate websites are connected, in some way, to the firm economic activity. On the basis of this relation, this paper proposes an intelligent system that analyzes corporate websites to produce web indicators related to the economic activity of the firms. This system has been successfully implemented and applied to infer company size characteristics from data gathered from corporate websites. Our results show that relatively large companies provide web content in a foreign language and use proprietary web servers.
{"title":"An Intelligent System for Retrieving Economic Information from Corporate Websites","authors":"J. Domenech, B. D. L. Ossa, A. Pont, J. A. Gil, Milagros Martinez, A. Rubio","doi":"10.1109/WI-IAT.2012.92","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.92","url":null,"abstract":"The prompt availability of up-to-date economic indicators is crucial to monitor the economy and to steer the design of policies for promoting business innovation and raising firm competitiveness. Economic indicators usually suffer important lags since they are commonly obtained from official databases or from interviews to a sample of agents, thus limiting the representative ness and usefulness of the information. In a context in which the presence of companies in the World Wide Web is almost an obligation to succeed, corporate websites are connected, in some way, to the firm economic activity. On the basis of this relation, this paper proposes an intelligent system that analyzes corporate websites to produce web indicators related to the economic activity of the firms. This system has been successfully implemented and applied to infer company size characteristics from data gathered from corporate websites. Our results show that relatively large companies provide web content in a foreign language and use proprietary web servers.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"43 s6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120839458","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}
For sentiment classification, there exist a heterogeneous mass of resources such as semantic dictionaries, unlabeled corpora, and heuristic rules. In this paper, based on a graph-based semi-supervised algorithm, we focus on exploiting multiple resources to construct similarity matrices which are fused by simple but effective schemes. We reported encouraging results of the experiments in sentiment classification, which indicate that the adopted algorithm can utilize multiple resources to improve performance.
{"title":"Using Multiple Resources in Graph-Based Semi-supervised Sentiment Classification","authors":"Ge Xu, Houfeng Wang","doi":"10.1109/WI-IAT.2012.18","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.18","url":null,"abstract":"For sentiment classification, there exist a heterogeneous mass of resources such as semantic dictionaries, unlabeled corpora, and heuristic rules. In this paper, based on a graph-based semi-supervised algorithm, we focus on exploiting multiple resources to construct similarity matrices which are fused by simple but effective schemes. We reported encouraging results of the experiments in sentiment classification, which indicate that the adopted algorithm can utilize multiple resources to improve performance.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121252405","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}
The occurrence of major emergencies would have a certain impact on the production of related enterprises, industry outlook, even on national macroeconomic situation. The impact is presented as price fluctuation of event-related enterprises' stock. Fortunately, the web search data reflects the trends of investors' behavior and contains hundreds of millions of searchers' concerns and interests on the emergencies and the demand for stocks trading. Therefore, we propose the idea of applying web search data to study the fluctuation of stock market caused by major emergencies. Firstly, a systematic theoretical framework has been built to reveal the correlation between web search and major emergency. Secondly, at the theoretical framework basis, this paper analyzes the impact strength and impact period on stock market brought by major emergency through using web search data. Furthermore, we take 723 Yong Wen EMU (Electric Multiple Units) Accident as a typical research object to verify the relationship. The results show that goodness of fit reaches 0.888 by adding the web search index variable into the model, and confirm that web search data would accurately and timely characterize the impact of the EMU accident on the stock market fluctuation. Finally, based on GARCH model, we study the impact period of EMU accident on the stock market, which is about two months.
{"title":"An Impact Analysis of Emergency Event on Stock Market Based on Web Search Data: A Case from 723 Yongwen Railway Accident","authors":"Y. Xin, Benfu Lv, S. Yi, Geng Peng","doi":"10.1109/WI-IAT.2012.76","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.76","url":null,"abstract":"The occurrence of major emergencies would have a certain impact on the production of related enterprises, industry outlook, even on national macroeconomic situation. The impact is presented as price fluctuation of event-related enterprises' stock. Fortunately, the web search data reflects the trends of investors' behavior and contains hundreds of millions of searchers' concerns and interests on the emergencies and the demand for stocks trading. Therefore, we propose the idea of applying web search data to study the fluctuation of stock market caused by major emergencies. Firstly, a systematic theoretical framework has been built to reveal the correlation between web search and major emergency. Secondly, at the theoretical framework basis, this paper analyzes the impact strength and impact period on stock market brought by major emergency through using web search data. Furthermore, we take 723 Yong Wen EMU (Electric Multiple Units) Accident as a typical research object to verify the relationship. The results show that goodness of fit reaches 0.888 by adding the web search index variable into the model, and confirm that web search data would accurately and timely characterize the impact of the EMU accident on the stock market fluctuation. Finally, based on GARCH model, we study the impact period of EMU accident on the stock market, which is about two months.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122320716","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}
Qing Cheng, Zhong Liu, Jincai Huang, Cheng Zhu, Yanjun Liu
Community structure is very important for many real-world networks. It has been shown that communities are overlapping and hierarchical. However, most previous methods, based on the graph model, can't investigate these two properties of community structure simultaneously. Moreover, in some cases the use of simple graphs does not provide a complete description of the real-world network. After introducing hyper graphs to describe real-world networks and defining hyper-edge similarity measurement, we propose a Hierarchical Clustering method based on Hyper-edge Similarity (HCHS) to simultaneously detect both the overlapping and hierarchical properties of complex community structure, as well as using the newly introduced community density to evaluate the goodness of a community. The examples of application to real-world networks give excellent results.
{"title":"Hierarchical Clustering Based on Hyper-edge Similarity for Community Detection","authors":"Qing Cheng, Zhong Liu, Jincai Huang, Cheng Zhu, Yanjun Liu","doi":"10.1109/WI-IAT.2012.9","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.9","url":null,"abstract":"Community structure is very important for many real-world networks. It has been shown that communities are overlapping and hierarchical. However, most previous methods, based on the graph model, can't investigate these two properties of community structure simultaneously. Moreover, in some cases the use of simple graphs does not provide a complete description of the real-world network. After introducing hyper graphs to describe real-world networks and defining hyper-edge similarity measurement, we propose a Hierarchical Clustering method based on Hyper-edge Similarity (HCHS) to simultaneously detect both the overlapping and hierarchical properties of complex community structure, as well as using the newly introduced community density to evaluate the goodness of a community. The examples of application to real-world networks give excellent results.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126791049","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}
Green-waved traffic control, which coordinates intersections to allow continuous traffic flow from major directions without unnecessary stops, is one of the most efficient strategies to improve the efficiency of urban transportation. However, in large-scale urban transportation systems, traditional centralized coordination methods suffer bottlenecks in both communication and computation. It is hard to make decentralized control with very limited observation to the whole network or avoid conflict traffic flows within a complex intersection. In this paper, we proposed a novel decentralized, multi-agent based schema for massive traffic lights coordination to promote the green-waved effect. In additional, we use constraint optimization agents within a local intersection to efficiently search for joint activities of the lights. This paper also builds a heuristic algorithm to solve the scalable coordination problem and with our massive urban transportation simulator, we have proved the feasibility of our approach.
{"title":"Green-Waved Cooperative Coordination Algorithm for Decentralized Traffic Control","authors":"Yulin Zhang, Yang Xu, Tingting Sun, Pengfei Liu","doi":"10.1109/WI-IAT.2012.141","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.141","url":null,"abstract":"Green-waved traffic control, which coordinates intersections to allow continuous traffic flow from major directions without unnecessary stops, is one of the most efficient strategies to improve the efficiency of urban transportation. However, in large-scale urban transportation systems, traditional centralized coordination methods suffer bottlenecks in both communication and computation. It is hard to make decentralized control with very limited observation to the whole network or avoid conflict traffic flows within a complex intersection. In this paper, we proposed a novel decentralized, multi-agent based schema for massive traffic lights coordination to promote the green-waved effect. In additional, we use constraint optimization agents within a local intersection to efficiently search for joint activities of the lights. This paper also builds a heuristic algorithm to solve the scalable coordination problem and with our massive urban transportation simulator, we have proved the feasibility of our approach.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126932332","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}
We consider a problem of automated object description and clustering. Because traditional image-processing-based object recognition algorithms can only cluster objects in image-base, we propose a method to describe an object in human language and group similar objects together in text-processing way. This paper describes a system that recognizes objects with text labels printed on the surface of objects themselves or their packing cases. By analyzing them, objects could be described in English words, and then be clustered into corresponding groups.
{"title":"Semantic-Feature-Based Object Recognition by Using Internet Data Mining","authors":"Jing Xu, S. Okada, K. Nitta","doi":"10.1109/WI-IAT.2012.145","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.145","url":null,"abstract":"We consider a problem of automated object description and clustering. Because traditional image-processing-based object recognition algorithms can only cluster objects in image-base, we propose a method to describe an object in human language and group similar objects together in text-processing way. This paper describes a system that recognizes objects with text labels printed on the surface of objects themselves or their packing cases. By analyzing them, objects could be described in English words, and then be clustered into corresponding groups.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125251112","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}
As an effective technique for dimensionality reduction, feature selection has a broad application in different research areas. In this paper, we present a feature selection method based on a novel feature clustering procedure, which aims at partitioning the features into different clusters such that the features in the same cluster contain similar structural information of the given instances. Subsequently, since the obtained feature subset consists of features from variant clusters, the similarity between selected features will be low. This allows us to reserve the most data structural information with the minimum number of features. Experimental results on different benchmark data sets demonstrate the superiority of the proposed method.
{"title":"Unsupervised Feature Selection with Feature Clustering","authors":"Yiu-ming Cheung, Hong Jia","doi":"10.1109/WI-IAT.2012.259","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.259","url":null,"abstract":"As an effective technique for dimensionality reduction, feature selection has a broad application in different research areas. In this paper, we present a feature selection method based on a novel feature clustering procedure, which aims at partitioning the features into different clusters such that the features in the same cluster contain similar structural information of the given instances. Subsequently, since the obtained feature subset consists of features from variant clusters, the similarity between selected features will be low. This allows us to reserve the most data structural information with the minimum number of features. Experimental results on different benchmark data sets demonstrate the superiority of the proposed method.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126394803","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}
In repeated multi-agent constant-sum games, each player's objective is to maximize control over a finite set of resources. We introduce Tens potter, an easy-to-use publicly-available game designed to allow human players to compete as agents against a machine algorithm. The algorithm learns play strategies from humans, reduces them to nine basic strategies, and uses this knowledge to build and adapt its collusion strategy. We use a tournament format to test our algorithm against human players as well as against other established multi-agent algorithms taken from the literature. Through these tournament experiments, we demonstrate how learning techniques adapted using human computation -- information obtained from both human and machine inputs -- can contribute to the development of an algorithm able to defeat two well-established multi-agent machine algorithms in tournament play.
{"title":"Developing a Repeated Multi-agent Constant-Sum Game Algorithm Using Human Computation","authors":"Christopher G. Harris","doi":"10.1109/WI-IAT.2012.175","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.175","url":null,"abstract":"In repeated multi-agent constant-sum games, each player's objective is to maximize control over a finite set of resources. We introduce Tens potter, an easy-to-use publicly-available game designed to allow human players to compete as agents against a machine algorithm. The algorithm learns play strategies from humans, reduces them to nine basic strategies, and uses this knowledge to build and adapt its collusion strategy. We use a tournament format to test our algorithm against human players as well as against other established multi-agent algorithms taken from the literature. Through these tournament experiments, we demonstrate how learning techniques adapted using human computation -- information obtained from both human and machine inputs -- can contribute to the development of an algorithm able to defeat two well-established multi-agent machine algorithms in tournament play.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124399899","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}
S. Hashimoto, Ryo Kanamori, Takayuki Ito, S. Chakraborty
Some auction systems are applied to the parking reservation system which would exert an important role in the next generation traffic systems. As an introduction evaluation of the auction systems for the parking reservation, we compare the results in case of a simultaneous auction and sequential one, and examine the influences of the strategy. Although the limited numerical experiment under the assumption that the number of parking space is only three, time zone is three, and also the total number of bidders are 25, the following results are obtained, 1) electricity trading makes a profit to both the parking manager and users 2) the average of the parking revenues would be the highest when the reservation price is a little higher than the expect bidding price.
{"title":"Evaluation of Parking Reservation System with Auction Including Electricity Trading","authors":"S. Hashimoto, Ryo Kanamori, Takayuki Ito, S. Chakraborty","doi":"10.1109/WI-IAT.2012.200","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.200","url":null,"abstract":"Some auction systems are applied to the parking reservation system which would exert an important role in the next generation traffic systems. As an introduction evaluation of the auction systems for the parking reservation, we compare the results in case of a simultaneous auction and sequential one, and examine the influences of the strategy. Although the limited numerical experiment under the assumption that the number of parking space is only three, time zone is three, and also the total number of bidders are 25, the following results are obtained, 1) electricity trading makes a profit to both the parking manager and users 2) the average of the parking revenues would be the highest when the reservation price is a little higher than the expect bidding price.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774414","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
扫码关注我们
求助内容：
应助结果提醒方式：