{"title":"Towards better understanding and utilizing relations in DBpedia","authors":"L. Fu, Haofen Wang, Wei Jin, Yong Yu","doi":"10.3233/WIA-2012-0247","DOIUrl":"https://doi.org/10.3233/WIA-2012-0247","url":null,"abstract":"This paper is concerned with the problems of understanding the relations in automatically extracted semantic datasets such as DBpedia and utilizing them in semantic queries such as SPARQL. Although DBpedia has achieved a great success in supporting convenient navigation and complex queries over the extracted semantic data from Wikipedia, the browsing mechanism and the organization of the relations in the extracted data are far from satisfactory. Some relations have anomalous names and are hard to be understood even by experts if looking at the relation names only; there exist synonymous and polysemous relations which may cause incomplete or noisy query results. In this paper, we propose to solve these problems by 1 exploiting the Wikipedia category system to facilitate relation understanding and query constraint selection, 2 exploring various relation representation models for similar/super-/sub-relation detection to help the users select proper relations in their queries. A prototype system has been implemented and extensive experiments are performed to illustrate the effectiveness of the proposed approach.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122054068","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}
{"title":"Robust distributed scheduling via time-period aggregation","authors":"Shih-Fen Cheng, J. Tajan, H. Lau","doi":"10.3233/WIA-2012-0248","DOIUrl":"https://doi.org/10.3233/WIA-2012-0248","url":null,"abstract":"In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation of the process decreases as the time frame length time frames are obtained by aggregating time periods increases. This is achieved without causing substantial deterioration in the mean performance.The main driver for the increase in robustness is that longer time frames result in allocations where resources are assigned in longer contiguous time blocks. The resulting resource continuity allows bidders to shift schedules upon realization of stochasticity. To demonstrate the generality of the notion that resource continuity increases allocation robustness, we perform further experiments on a decentralized variant of the classical job shop scheduling problem. The experiment results demonstrate similar benefits.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129800471","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}
{"title":"Towards improving the online shopping experience: A client-based platform for post-processing Web search results","authors":"Renan G. Cattelan, D. Kirovski","doi":"10.3233/WIA-2012-0242","DOIUrl":"https://doi.org/10.3233/WIA-2012-0242","url":null,"abstract":"The quality of results to Web search queries is substantially limited because of the cost and short processing times allowed at search engine's data center to retrieve relevant pages, augment ads, and present them to the end-user. We tackle such an issue by proposing a radically different system, where the search engine replies to a query with a large list of relevant URLs. Our client-side platform then proceeds to download the target HTML files only, parse them, understand their content, and present a summary to the user. Different types of summaries can be created by using plug-ins attached to the base platform. Each plug-in provides the required functionality according to the type of summary desired by the user. With this novel mechanism, our system offers increased computational power for post-processing search results and consequently improves and personalizes the user's search experience while maintaining constant workload at the search engine. We present prototype implementations of the proposed search assistant and an associated shopping plug-in capable of detecting whether a Web-page encapsulates a direct commercial offering. We also review measurements related to projected system performance and demonstrate its applicability to different scenarios.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130097735","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}
Xiaoyun He, Jaideep Vaidya, Basit Shafiq, N. Adam, V. Atluri
{"title":"Structure-aware graph anonymization","authors":"Xiaoyun He, Jaideep Vaidya, Basit Shafiq, N. Adam, V. Atluri","doi":"10.3233/WIA-2012-0241","DOIUrl":"https://doi.org/10.3233/WIA-2012-0241","url":null,"abstract":"Graph structured data can be ubiquitously found in the real world. For example, social networks can easily be represented as graphs where the graph connotes the complex sets of relationships between members of social systems. While their analysis could be beneficial in many aspects, publishing certain types of social networks raises significant privacy concerns. This brings the problem of graph anonymization into sharp focus. Unlike relational data, the true information in graph structured data is encoded within the structure and graph properties. Motivated by this, a structure-aware anonymization approach is proposed that maximally preserves the structure of the original network as well as its structural properties while anonymizing it. Instead of anonymizing each node one by one independently, the approach treats each partitioned substructural component of the network as one single unit to be anonymized. This maximizes utility while enabling anonymization. Since grouping and matching local structures are the essential steps for the anonymization, several alternative grouping and matching techniques are proposed and compared. The proposed methods are applied to both synthetic and real datasets to demonstrate their effectiveness and practical usefulness.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125735632","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}
{"title":"An intelligent Web agent that autonomously learns how to translate","authors":"M. Turchi, T. D. Bie, N. Cristianini","doi":"10.3233/WIA-2012-0239","DOIUrl":"https://doi.org/10.3233/WIA-2012-0239","url":null,"abstract":"We describe the design of an autonomous agent that can teach itself how to translate from a foreign language, by first assembling its own training set, then using it to improve its vocabulary and language model. The key idea is that a Statistical Machine Translation package can be used for the Cross-Language Retrieval Task of assembling a training set from a vast amount of available text e.g. a large multilingual corpus, or the Web and then train on that data, repeating the process several times. The stability issues related to such a feedback loop are addressed by a mathematical model, connecting statistical and control-theoretic aspects of the system. We test it on controlled environment and real-world tasks, showing that indeed this agent can improve its translation performance autonomously and in a stable fashion, when seeded with a very small initial training set. We develop a multiprocessor version of the agent that directly accesses the Web using a Web search engine and taking advantage of the big amount of data available there. The modelling approach we develop for this agent is general, and we believe that it will be useful for an entire class of self-learning autonomous agents working on the Web.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114080299","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}
{"title":"Text mining in negative relevance feedback","authors":"Abdulmohsen Algarni, Yuefeng Li, Sheng-Tang Wu, Yue Xu","doi":"10.3233/WIA-2012-0238","DOIUrl":"https://doi.org/10.3233/WIA-2012-0238","url":null,"abstract":"It is a big challenge to clearly identify the boundary between positive and negative streams. Several attempts have used negative feedback to solve this challenge; however, there are two issues for using negative relevance feedback to improve the effectiveness of information filtering. The first one is how to select constructive negative samples in order to reduce the space of negative documents. The second issue is how to decide noisy extracted features that should be updated based on the selected negative samples. This paper proposes a pattern mining based approach to select some offenders from the negative documents, where an offender can be used to reduce the side effects of noisy features. It also classifies extracted features i.e., terms into three categories: positive specific terms, general terms, and negative specific terms. In this way, multiple revising strategies can be used to update extracted features. An iterative learning algorithm is also proposed to implement this approach on RCV1, and substantial experiments show that the proposed approach achieves encouraging performance.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930983","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}
Dieudonné Tchuente, Marie-Françoise Canut, N. Jessel, A. Péninou, F. Sèdes
{"title":"Visualizing the relevance of social ties in user profile modeling","authors":"Dieudonné Tchuente, Marie-Françoise Canut, N. Jessel, A. Péninou, F. Sèdes","doi":"10.3233/WIA-2012-0245","DOIUrl":"https://doi.org/10.3233/WIA-2012-0245","url":null,"abstract":"Existing works about user profile modeling always model the user as an independent entity. However, in social sciences, many works show the user's behavior as strongly influenced by his social ties and/or social interactions. These results were difficult to integrate in user profile modeling because of the problem of capturing social data about users in infor-mation systems. With the advent of the social web for example, this barrier can be broken on the Web, and we can reasonably think about enriching users' profiles from social data. In this paper we propose a technique to develop users' profiles with social data. We built profiles from textual users' activities data, and we show through visualization of temporal graphs the relevance of social ties on built profiles with an experimentation carried out on 7, 081 Facebook profiles. These results motivated the potential implementation of new profiling techniques based on users' social networks, to enrich users' profiles and solve pending problems such as 'cold start problem' in personalized or recommender systems.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132808136","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}
{"title":"Using multiagent self-organization techniques for seeking information in virtual social communities","authors":"Annabelle Mercier, M. Occello, Jean-Paul Jamont","doi":"10.3233/WIA-2012-0243","DOIUrl":"https://doi.org/10.3233/WIA-2012-0243","url":null,"abstract":"This paper proposes an approach which aims at improving information access skills, services in large networks. It proposes a self-organized multiagent analysis of the problem allowing to reduce the number of messages transmitted for a skill search. The MWAC Multi-Wireless-Agent Communication model is extended to take some specificities of social networks into account, like the information held by the social network members and their connections with the others.The network of agents may represent a social network. Each agent holds information about members agents and is linked with other agents which represent its neighborhood. Each member builds a local network representation according to its needs. A global view of a social network is not dynamically available and furthermore not desirable. Our approach is thus based on a decentralized interrogation of the network and on organizational structures detection.With this method, a search does not need to flood all the network with the query because it uses the self-organized structure that emerges so, it can avoid a saturation in the network and it reduces the amount of transmitted messages. In order to show the interest of the approach, our proposition is validated by several simulations. The applications of this work are related to skill searching in a virtual social network.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118060","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}
{"title":"An obligation-based framework for web service composition via agent conversations","authors":"Octavio Gutiérrez, F. Corchado, Jean-Luc Koning","doi":"10.3233/WIA-2012-0237","DOIUrl":"https://doi.org/10.3233/WIA-2012-0237","url":null,"abstract":"This paper presents a framework for web service composition based on social norms, particularly obligations. Web services are implemented and orchestrated by agents. Agent interaction is defined by means of obligations. Then, obligation-based agent conversations are translated into a web service composition method. Web services' functionalities are conceived as a set of actions with preconditions and effects, both expressed in terms of obligations that are adopted by agents as goals. In addition, an agent communication language that defines how messages affect agents' states, and as a consequence, the access to the services is presented. Moreover, a method for automatically creating generic composer agents is proposed. Composer agents are capable of managing and composing web services by means of inducing obligations to agents that implement and orchestrate web services.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"306 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132557017","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}
{"title":"OntoStoria2: A shared representation and a web-based tool for the collaboration of services providers","authors":"F. Bugeaud, E. Soulier","doi":"10.3233/WIA-2012-0244","DOIUrl":"https://doi.org/10.3233/WIA-2012-0244","url":null,"abstract":"Today, enterprises have to be customer and service oriented in order to adapt themselves to a more and more competitive and evolving context. Their innovators actors of the innovation have to collaborate in order to anticipate the customers' needs. To do so, they work as a virtual team a remote and inter-professional network and try to describe services situations, to detect lacks and opportunities, and to propose the design of adapted solutions. Based on the service literature and the discussions of the Service Science Management and Engineering SSME discipline, we conceive the service as a dynamic configuration of heterogeneous entities: a “Service System”. We then suggest formalizing it with a mereological ontology collective classes instead of distributive classes of processual entities processes instead of substances in order to highlight its dynamic dimension. The Service System acts as an intermediary object aiming at the innovators' cooperation and creativity during a co-design phase. Its modelling reveals all the possible experiences within a situation through the identification of the relationships between processual entities. A co-modelling process and a web-based tool are currently tested upstream of the services design process of a French telecom operator. This operator's process and experiments are good examples.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116628005","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}