Learning and inferencing in user ontology for personalized Semantic Web search

User modeling is aimed at capturing the users’ interests in a working domain, which forms the basis of providing personalized information services. In this paper, we present an ontology based user model, called user ontology, for providing personalized information service in the Semantic Web. Different from the existing approaches that only use concepts and taxonomic relations for user modeling, the proposed user ontology model utilizes concepts, taxonomic relations, and non-taxonomic relations in a given domain ontology to capture the users’ interests. As a customized view of the domain ontology, a user ontology provides a richer and more precise representation of the user’s interests in the target domain. Specifically, we present a set of statistical methods to learn a user ontology from a given domain ontology and a spreading activation procedure for inferencing in the user ontology. The proposed user ontology model with the spreading activation based inferencing procedure has been incorporated into a semantic search engine, called OntoSearch, to provide personalized document retrieval services. The experimental results, based on the ACM digital library and the Google Directory, support the efficacy of the user ontology approach to providing personalized information services.     

Law-abiding and integrity on the Internet: A case for agents

Software agents extend the current, information-based Internet to include autonomous mobile processing. In most countries such processes, i.e., software agents are, however, without an explicit legal status. Many of the legal implications of their actions (e.g., gathering information, negotiating terms, performing transactions) are not well understood. One important characteristic of mobile software agents is that they roam the Internet: they often run on agent platforms of others. There often is no pre-existing relation between the “owner” of a running agent’s process and the owner of the agent platform on which an agent process runs. When conflicts arise, the position of the agent platform administrator is not clear: is he or she allowed to slow down the process or possibly remove it from the system? Can the interests of the user of the agent be protected? This article explores legal and technical perspectives in protecting the integrity and availability of software agents and agent platforms.     

Ontology-based user profile learning

Personal agents gather information about users in a user profile. In this work, we propose a novel ontology-based user profile learning. Particularly, we aim to learn context-enriched user profiles using data mining techniques and ontologies. We are interested in knowing to what extent data mining techniques can be used for user profile generation, and how to utilize ontologies for user profile improvement. The objective is to semantically enrich a user profile with contextual information by using association rules, Bayesian networks and ontologies in order to improve agent performance. At runtime, we learn which the relevant contexts to the user are based on the user’s behavior observation. Then, we represent the relevant contexts learnt as ontology segments. The encouraging experimental results show the usefulness of including semantics into a user profile as well as the advantages of integrating agents and data mining using ontologies.     

Learning for automatic personalization in a semantic taxonomy-based meta-search agent

Providing highly relevant page hits to the user is a major concern in Web search. To accomplish this goal, the user must be allowed to express his intent precisely. Secondly, page hit rating mechanisms should be used that take the user’s intent into account. Finally, a learning mechanism is needed that captures a user’s preferences in his Web search, even when those preferences are changing dynamically. To address the first two issues, we propose a semantic taxonomy-based meta-search agent approach that incorporates the user’s taxonomic search intent. It also addresses relevancy improvement issues of the resulting page hits by using user’s search intent and preference-based rating. To provide a learning mechanism, we first propose a connectionist model-based user profile representation approach, which can leverage all of the features of the semantic taxonomy-based information retrieval approach. A user profile learning algorithm is also devised for our proposed user profile representation framework by significantly modifying and extending a typical neural network learning algorithm. Finally, the entire methodology including this learning mechanism is implemented in an agent-based system, WebSifter II. Empirical results of learning performance are also discussed.     

Measuring the understanding between two agents through concept similarity

Two agents previously unknown to each other cannot communicate by exchanging concepts (nodes of their own ontology): they need to use a common communication language. If they do not use a standard protocol, most likely they use a natural language. The ambiguities of it, and the different concepts the agents possess, give rise to imperfect understanding among them: How closely concepts in ontology O_A map¹ to which of O_B? Can we measure these mismatches?Given a concept from ontology O_A, a method is provided to find the most similar concept in O_B, and to measure the similarity between both concepts. The paper also gives an algorithm to gauge du(A, B), the degree of understanding that agent A has about the ontology of B. The procedures use word comparison, since no agent (except the Very Wise Creature, VWC) can measure du directly. Examples are given.     

Modelling user preferences and mediating agents in electronic commerce

An important ingredient in agent-mediated electronic commerce is the presence of intelligent mediating agents that assist electronic commerce participants (e.g. individual users, other agents, organisations). These mediating agents are in principle autonomous agents that interact with their environments (e.g. other agents and web-servers) on behalf of participants who have delegated tasks to them. For mediating agents a (preference) model of participants is indispensable. In this paper, a generic mediating agent architecture is introduced. Furthermore, we discuss our view of user preference modelling and its need in agent-mediated electronic commerce. We survey the state of the art in the field of preference modelling and suggest that the preferences of electronic commerce participants can be modelled by learning from their behaviour. In particular, we employ an existing machine learning method called inductive logic programming (ILP). We argue that this method can be used by mediating agents to detect regularities in the behaviour of the involved participants and induce hypotheses about their preferences automatically. Finally, we discuss some advantages and disadvantages of using inductive logic programming as a method for learning user preferences and compare this method with other approaches.     

Common understanding in a multi-agent system using ontology-guided learning

Traditionally, communication among agents has been established based on the group commitment to a common ontology which is unfortunately often too strong or unrealistic. In the real world of communicating agents, it is preferred to enable agents to exchange information while they keep their own individual ontology. While this assumption makes agents represent their knowledge more independently and give them more flexibility, it also adds to the complexity of communication. We believe that agents can overcome this complexity by using their learning capability. The agents can learn any concept they do not know but want to communicate about with other agents in the multi-agent system where they work in. Our goal in this paper is to present a general method for agents using ontologies to teach each other concepts to improve their communication, and therefore cooperation abilities. In our method, a particular agent that understands a concept only ambiguously intends to learn it by receiving positive and negative examples for that concept from the other agents. Then, utilizing one of the known concept learning methods, the agent learns the concept in question. In case of conflicts in the received set of examples, the learning agent asks other agents again to get involved in the learning process by taking votes. While this method allows agents not to share common ontologies, it enables agents to establish common grounds on the concepts known only by some of them if these common grounds are needed during cooperation. In fact, the learned concepts by an agent are compromised among the views of other agents the method improves the autonomy of agents using them significantly.     

The role of information structures in game-theoretic multi-agent learning

Multi-agent learning (MAL) studies how agents learn to behave optimally and adaptively from their experience when interacting with other agents in dynamic environments. The outcome of a MAL process is jointly determined by all agents’ decision-making. Hence, each agent needs to think strategically about others’ sequential moves, when planning future actions. The strategic interactions among agents makes MAL go beyond the direct extension of single-agent learning to multiple agents. With the strategic thinking, each agent aims to build a subjective model of others decision-making using its observations. Such modeling is directly influenced by agents’ perception during the learning process, which is called the information structure of the agent’s learning. As it determines the input to MAL processes, information structures play a significant role in the learning mechanisms of the agents. This review creates a taxonomy of MAL and establishes a unified and systematic way to understand MAL from the perspective of information structures. We define three fundamental components of MAL: the information structure (i.e., what the agent can observe), the belief generation (i.e., how the agent forms a belief about others based on the observations), as well as the policy generation (i.e., how the agent generates its policy based on its belief). In addition, this taxonomy enables the classification of a wide range of state-of-the-art algorithms into four categories based on the belief-generation mechanisms of the opponents, including stationary, conjectured, calibrated, and sophisticated opponents. We introduce Value of Information (VoI) as a metric to quantify the impact of different information structures on MAL. Finally, we discuss the strengths and limitations of algorithms from different categories and point to promising avenues of future research.     

A fuzzy connectionist expert system for visual pattern classification

In this paper, a connectionist model to integrate knowledge-based techniques into neural network approaches for visual pattern classification is presented. We propose a new structure of connectionist model which has rule-following capability as well as instance-based learning capability. Each node of the proposed network is doubly linked by two types of connections: positive connection and negative connection. Such connectionism provides a methodology to construct the classifier from the rule base and allows the expert knowledge to be utilized for the effective learning. For visual pattern classification, we present the techniques for knowledge representation and utilization using the concepts of fuzzy rules and fuzzy relations. We also discuss in this paper some advantageous characteristics of the model: result explanation capability and rule refinement capability. From the experimental results of the handwritten digit classification, the feasibility of the proposed model is evaluated.     

An integrated symbolic/connectionist architecture for parsing italian sentences containing pp-attachment ambiguities

This paper describes a hybrid (symbolic/connectionist) system that performs PP-attachment disambiguation by taking advantage of three distinguishing features of neutral networks: distributed representation, functional compositionality, and inductive learning. The connectionist part of the system follows all the steps performed by the symbolic parser, and drives the parser's behavior by inducing a bias towards the most semantically plausible attachment choices. The sentence to be parsed is read one word at a time. When the symbolic parser has more than one production to apply, the connectionist module has already developed an inner representation of the sentence and a distribution of probabilities over the possible choices. The parser continues its work according to such a distribution.     

基于多智能体系统的面向对象本体研究

智能体间的信息交互和行为协调是共同完成被委托任务的必要条件,论文提出了在多智能体系统中智能体本身必须建立领域模型的技术要求,即用本体支持运行时的语义交互。为此,文中用面向对象的知识表示方法描述并建立本体,并以此为基础形成领域操作代数系统和智能体服务描述语言。结合开放购买的仿真案例,表明在一个完整的情景语义交互中,服务提供方需要以智能体服务描述语言表述自己提供服务的方法和过程,而接受服务方必须在理解智能体服务描述语言的基础上,获取某一具体服务。     

A general framework for adaptive processing of data structures

A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to relatively poor structures, like arrays or sequences. The framework described in this paper is an attempt to unify adaptive models like artificial neural nets and belief nets for the problem of processing structured information. In particular, relations between data variables are expressed by directed acyclic graphs, where both numerical and categorical values coexist. The general framework proposed in this paper can be regarded as an extension of both recurrent neural networks and hidden Markov models to the case of acyclic graphs. In particular we study the supervised learning problem as the problem of learning transductions from an input structured space to an output structured space, where transductions are assumed to admit a recursive hidden state-space representation. We introduce a graphical formalism for representing this class of adaptive transductions by means of recursive networks, i.e., cyclic graphs where nodes are labeled by variables and edges are labeled by generalized delay elements. This representation makes it possible to incorporate the symbolic and subsymbolic nature of data. Structures are processed by unfolding the recursive network into an acyclic graph called encoding network. In so doing, inference and learning algorithms can be easily inherited from the corresponding algorithms for artificial neural networks or probabilistic graphical model.     

基于Ontology的用户模型研究

针对现有本体用户模型的难点与不足，提出了一种改进的基于领域本体的用户模型（OBUM），利用文本挖掘技术构建领域本体，通过本体学习来完成用户模型的学习和更新。     

Effects of an ontology display with history representation on organizational memory information systems

Ontologies, as a possible element of organizational memory information systems, appear to support organizational learning. Ontology tools can be used to share knowledge among the members of an organization. However, current ontology-viewing user interfaces of ontology tools do not fully support organizational learning, because most of them lack proper history representation in their display. In this study, a conceptual model was developed that emphasized the role of ontology in the organizational learning cycle and explored the integration of history representation in the ontology display. Based on the experimental results from a split-plot design with 30 participants, two conclusions were derived: first, appropriately selected history representations in the ontology display help users to identify changes in the ontologies; and second, compatibility between types of ontology display and history representation is more important than ontology display and history representation in themselves.     

一个基于CORBA的图形用户界面体系结构及实例

随着网络计算技术的发展,软件的结构变为表示／处理／数据库分离的三级模式。表示与处理的分离导致了用户界面与应用计算间的通信成为开发交互式系统图形用户界面的关键。本文为分布式交互图形应用的开发提供了一个基于公用对象需求代理结构ＣＯＲＢＡ的用户界面体系结构,ＣＯＲＢＡ是为分布式对象系统中间件制定的一个互操作标准。在这个结构中,一些被称为代理的面向对象交互式图形构件被设计用来为图形的表示与交互提供有效的解     

Effects of an ontology display with history representation on organizational memory information systems

Ontologies, as a possible element of organizational memory information systems, appear to support organizational learning. Ontology tools can be used to share knowledge among the members of an organization. However, current ontology-viewing user interfaces of ontology tools do not fully support organizational learning, because most of them lack proper history representation in their display. In this study, a conceptual model was developed that emphasized the role of ontology in the organizational learning cycle and explored the integration of history representation in the ontology display. Based on the experimental results from a split-plot design with 30 participants, two conclusions were derived: first, appropriately selected history representations in the ontology display help users to identify changes in the ontologies; and second, compatibility between types of ontology display and history representation is more important than ontology display and history representation in themselves.     

Ontology based web simulation system for hydrodynamic modeling

Hydrodynamic models generally deal with large sets of data and utilize substantial computational resources. Powerful, robust servers with extensive storage capabilities are desirable for rapid execution. Unfortunately, it is not always possible to effort those kinds of facilities whereas a centralized computer system together with a user access interface can be a viable alternative for many clients. The simplest way a client can communicate with the central simulation server is by a web browser because it is available as a pre-installed application on most every computing platform purchased today. This type of environment is called web based simulation or WBS. In this study, the concepts necessary to design and develop a WBS for the simulation of hydrodynamic processes using legacy (FORTRAN) code are introduced. A formal specification of the simulation domain or an ontology has been developed that is the underlying concept to share, retrieve, and move the simulation data between the different components of the WBS. This ontology can also be used for future analysis and reuse of the simulation domain concepts and the associated data sets.     

Fuzzy ontologies-based user profiles applied to enhance e-learning activities

Nowadays, the impact of technological developments on improving human activities is becoming more evident. In e-learning, this situation is no different. There are common to use systems that assist the daily activities of students and teachers. Typically, e-learning recommender systems are focused on students; however, teachers can also benefit from these type of tools. A recommender system can propose actions and resources that facilitate teaching activities like structuring learning strategies. In any case, a complete user’s representation is required. This paper shows how a fuzzy ontology can be used to represent user profiles into a recommender engine and enhances the user’s activities into e-learning environments. A fuzzy ontology is an extension of domain ontologies for solving the problems of uncertainty in sharing and reusing knowledge on the Semantic Web. The user profile is built from learning objects published by the user himself into a learning object repository. The initial experiment confirms that the automatically obtained fuzzy ontology is a good representation of the user’s preferences. The experiment results also indicate that the presented approach is useful and warrants further research in recommending and retrieval information.     

MASHA: A multi-agent system handling user and device adaptivity of Web sites

A user that navigates on the Web using different devices should be characterized by a global profile, which represents his behaviour when using all these devices. Then, the user’s profile could be usefully exploited when interacting with a site agent that is able to provide useful recommendations on the basis of the user’s interests, on one hand, and to adapt the site presentation to the device currently exploited by the user, on the other hand. However, it is not suitable to construct such a global profile by a software running on the exploited device since this device (e.g., a mobile phone or a palmtop) may have limited resources. Therefore, in this paper, we propose a multi-agent architecture, called MASHA, handling user and device adaptivity of Web sites, in which each device is provided with a client agent that autonomously collects information about the user’s behaviour associated to just that device. However, the user profile contained in this client is continuously updated with information coming from a unique server agent, associated with the user. Such information is collected by the server agent from the different devices exploited by the user, and represents a global user profile. The third component of this architecture, called adapter agent, is capable to generate a personalized representation of the Web site, containing some useful recommendations derived by both an analysis of the user profile and the suggestions coming from other users exploiting the same device.     

A connectionist computational model for epistemic and temporal reasoning

The importance of the efforts to bridge the gap between the connectionist and symbolic paradigms of artificial intelligence has been widely recognized. The merging of theory (background knowledge) and data learning (learning from examples) into neural-symbolic systems has indicated that such a learning system is more effective than purely symbolic or purely connectionist systems. Until recently, however, neural-symbolic systems were not able to fully represent, reason, and learn expressive languages other than classical propositional and fragments of first-order logic. In this article, we show that nonclassical logics, in particular propositional temporal logic and combinations of temporal and epistemic (modal) reasoning, can be effectively computed by artificial neural networks. We present the language of a connectionist temporal logic of knowledge (CTLK). We then present a temporal algorithm that translates CTLK theories into ensembles of neural networks and prove that the translation is correct. Finally, we apply CTLK to the muddy children puzzle, which has been widely used as a test-bed for distributed knowledge representation. We provide a complete solution to the puzzle with the use of simple neural networks, capable of reasoning about knowledge evolution in time and of knowledge acquisition through learning.