The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed...
详细信息
The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.
We present here an approach for dynamic ontology integration for a multi-agent environment, in which each agent holds the ontologies of its acquaintances (i.e., other agents of its interest) as the integrated partial ...
详细信息
We present here an approach for dynamic ontology integration for a multi-agent environment, in which each agent holds the ontologies of its acquaintances (i.e., other agents of its interest) as the integrated partial global ontology, which is essential to interpret the local schemas for inter-agent operations. This integration has to be carried out whenever a new acquaintance is added or when the local ontology of an acquaintance changes. The approach described is general (i.e., independent of any particular thesaurus) and it carries out the integration automatically except for minimal unavoidable human inputs to resolve semantic conflicts if discovered in the process.
When deploying collaborative applications such as instant messaging in ubiquitous computing environments significant enhancements can be afforded by offering additional context information, such as location informatio...
详细信息
When deploying collaborative applications such as instant messaging in ubiquitous computing environments significant enhancements can be afforded by offering additional context information, such as location information. However, such environments exert key challenges such as increased diversity of ownership and ad hoc, intermittent network connectivity that suits more decentralized computing architectures. This paper examines how a migration to a more decentralized collaborative architecture can be achieved together with a decentralization of the management of collaborative activities
As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely...
详细信息
As context-aware systems become more widespread and mobile there is an increasing need for a common distributed event platform for gathering context information and delivering to context-aware applications. The likely heterogeneity across the body of context information can be addressed using runtime reasoning over ontology-based context models. However, existing knowledge-based reasoning is not typically optimised for real-time operation so its inclusion in any context delivery platform needs to be carefully evaluated from a performance perspective. In this paper we propose a benchmark for knowledge-based context delivery platforms and in particular examine suitable knowledge benchmarks for assessing the ability of platforms to deal with semantic interoperability
Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific sk...
详细信息
Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific sk...
详细信息
ISBN:
(纸本)9783885791881
Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. In this paper we specify a formal model for folksonomies, briefly describe our own system BibSonomy, which allows for sharing both bookmarks and publication references, and discuss first steps towards emergent semantics.
The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network knowledge without necessarily binding ex...
详细信息
The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network knowledge without necessarily binding explicitly to all of the potential sources of that knowledge. Though event-based publish-subscribe models allow efficient distribution of knowledge where the event types are known globally, dynamic service chains, ad hoc networks and pervasive computing application all introduce a more fluid and heterogeneous range of context knowledge. This requires some runtime translation of knowledge between sources and sinks of network context. This paper builds on existing mapping techniques that use ontological forms of existing management information models to examine the extent to which these can be employed for runtime semantic interoperability for network knowledge. It presents results in developing a management knowledge delivery framework based on existing models and platforms, but which offers a more decentralized knowledge exchange mechanism
In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for fo...
详细信息
In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006 [3].
We can see Multi-Agent Systems (MAS) like a society of agents that cooperates to work in the best way possible. With this we gain the ability of solve complex problems like dynamic and distributed scheduling. MAS cons...
详细信息
We can see Multi-Agent Systems (MAS) like a society of agents that cooperates to work in the best way possible. With this we gain the ability of solve complex problems like dynamic and distributed scheduling. MAS consists of several autonomous entities, called agents, that interact with each other to either further their own interests, trough competition or in pursuit a common objective trough cooperation. Social aspects are considered when a community of autonomous agents cooperate to reach a common goal. Agents negotiate in a cooperative way, in order to find a consistent overall plan, while avoiding significant changes onto their current best possible local plans. In this work we consider that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and cooperating with other machine agents. A cooperative negotiation mechanism is proposed for solving the schedules coordination process in the Multi-Agent System for Dynamic Scheduling in Manufacturing with Genetic Algorithms and Tabu Search (MASDScheGATS).
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query routing process. It gradually improves r...
详细信息
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query routing process. It gradually improves routing efficiency with no excessive network overhead of the routing index construction and maintenance. However, the previously proposed mechanism is not practically effective due to the slow improvement of routing efficiency. In this paper, we propose a novel mechanism for query-oriented routing indices which quickly achieves high routing efficiency at low cost. The maintenance method employs reinforcement learning to utilize mass peer behaviors to construct and maintain routing indices. It explicitly uses the expected value of returned content number to depict the content distribution, which helps quickly approximate the real distribution. Meanwhile, the routing method is to retrieve as many contents as possible. It also helps speed up the learning process further. The experimental evaluation shows that the mechanism has high routing efficiency, quick learning ability and satisfactory performance under churn
暂无评论