Projective clustering is a clustering technique for high dimensional data with the inherent sparsity of the data points. To overcome the unreliable measure of similarity among data points in high dimensions, all data ...
详细信息
Projective clustering is a clustering technique for high dimensional data with the inherent sparsity of the data points. To overcome the unreliable measure of similarity among data points in high dimensions, all data points are projected to a lower dimensional sub-space. Principal component analysis (PCA) is an efficient method to dimensionality reduction by projecting all points to a lower dimensional subspace so that the information loss is minimized. However, PCA does not handle well the situation that different clusters are formed in different subspaces. We propose a method of multiple principal component analysis for iteratively computing projective clusters. The objective function is designed to determine the subspace associated with each cluster. Some experiments have been carried out to show the effectiveness of the proposed method.
The paper presents a general architecture for a P2P data sharing facility within a multi-agent framework, where peers as autonomous high-level nodal agents cooperate with each other to solve global tasks. A node may h...
详细信息
The paper presents a general architecture for a P2P data sharing facility within a multi-agent framework, where peers as autonomous high-level nodal agents cooperate with each other to solve global tasks. A node may have several lower level local agents including local databases and partial global ontologies. In addition there are also minder agents coordinating the activities of the peers that offer the same type of service, thus providing fault-tolerance. The ability of this architecture in data and task sharing has been demonstrated by considering query processing and directory update strategies.
Clustering is a task of grouping data based on similarity. A popular k-means algorithm groups data by firstly assigning all data points to the closest clusters, then determining the cluster means. The algorithm repeat...
详细信息
Clustering is a task of grouping data based on similarity. A popular k-means algorithm groups data by firstly assigning all data points to the closest clusters, then determining the cluster means. The algorithm repeats these two steps until it has converged. We propose a variation called weighted k-means to improve the clustering scalability. To speed up the clustering process, we develop the reservoir-biased sampling as an efficient data reduction technique since it performs a single scan over a data set. Our algorithm has been designed to group data of mixture models. We present an experimental evaluation of the proposed method.
This paper describes the derivation and design of an array of self-organizing networks trained by inductive learning for one step ahead prediction of the outputs of the pre-precipitation stage of a wastewater treatmen...
详细信息
This paper describes the derivation and design of an array of self-organizing networks trained by inductive learning for one step ahead prediction of the outputs of the pre-precipitation stage of a wastewater treatment plant with a view to model predictive control of the stage
The trend towards outsourcing increases the number of documents stored at external service providers. This storage model, however, raises privacy and security concerns because the service providers cannot be trusted w...
详细信息
The trend towards outsourcing increases the number of documents stored at external service providers. This storage model, however, raises privacy and security concerns because the service providers cannot be trusted with respect to maintaining the privacy of the documents. The research project SemCrypt^1 explores techniques for processing queries and updates over encrypted XML documents stored at untrusted servers. By performing encryption and decryption only on the client and not on the server, SemCrypt guarantees that neither the document structure nor the document content are disclosed on the server. Filtering query results and processing as much as possible of the query/update statement on the server does not depend on special encryption techniques. Instead, the chosen approach exploits the structural semantics of XML documents and uses standard, well-proven encryption techniques. SemCrypt thus enables to query and update encrypted XML documents on untrusted servers while ensuring data privacy.
Core to ubiquitous computing environments are adaptive software systems that adapt their behavior to the context in which the user is attempting the task the system aims to support. This context is strongly linked wit...
详细信息
Core to ubiquitous computing environments are adaptive software systems that adapt their behavior to the context in which the user is attempting the task the system aims to support. This context is strongly linked with the physical environment in which the task is being performed. The efficacy of such adaptive systems is thus highly dependent on the human perception of the provided system behavior within the context represented by that particular physical environment and social situation. However, effective evaluation of human interaction with adaptive ubiquitous computing technologies has been hindered by the cost and logistics of accurately controlling such environmental context. This paper describes TATUS, a ubiquitous computing simulator aimed at overcoming these cost and logistical issues. Based on a 3D games engine, the simulator has been designed to maximize usability and flexibility in the experimentation of adaptive ubiquitous computing systems. We also describe how this simulator is interfaced with a testbed for wireless communication domain simulation.
The evaluation of learner and tutor feedback is essential in the production of high quality personalized eLearning services. There are few evaluations available in the Adaptive Hypermedia domain relative to the amount...
详细信息
Developing adaptive, rich-media, eLearning courses tends to be a complex, highly-expensive and time-consuming task. A typical adaptive eLearning course will involve a multi-skilled development team of technologists, i...
详细信息
In this article, the authors provide an alternative view on Petri nets modeling of discrete event systems. The proposed modeling procedure follows the Systems Specification guidelines underlying the well-known DEVS mo...
详细信息
In this article, the authors provide an alternative view on Petri nets modeling of discrete event systems. The proposed modeling procedure follows the Systems Specification guidelines underlying the well-known DEVS modeling formalism. The authors' endeavour is towards perfecting the design of reusable Petri nets-based models by searching for a good primitive for a modular model construction and the introduction of coupling templates as standardised means to couple building block components. Assuming that the real-world system to be modeled has been analyzed in depth beforehand through a suitable system analysis method (which itself is beyond the scope of the article), we present a systematic step-by-step approach to construct a model in the Petri nets domain together with its experimental frame. The construction adheres to well-defined rules, which enable computer-based model construction. The input for this systematic bottom-up construction of Petri nets-models is information (about, e.g., primitive system components, entity flows, routing constructs) gathered from the top-down system analysis. In the article, attention is also paid to the algebraic backgrounds underlying the proposed model construction. These provide the basis for formal correctness proofs, mapping Petri nets onto DEVS-models, and complexity reduction of the found Petri nets-models. By offering to the model builder the possibility to handle multiple abstraction levels and by addressing important issues related to the interfacing question of coupled models and model components described in Petri nets and DEVS formalism, the authors' work addresses two of the main research directions of Computer Automated Multi-Paradigm Modeling ([Mosterman and Vangheluwe 2002]): model abstraction and multiformalism modeling. The article concludes with an illustrative application example.
Pervasive computing environments need to exhibit highly adaptive behavior to meet the changing task requirements and operational context of visiting mobile users. However this must be balanced with the need of resourc...
详细信息
Pervasive computing environments need to exhibit highly adaptive behavior to meet the changing task requirements and operational context of visiting mobile users. However this must be balanced with the need of resource owners to meet their goals in administering how users use their resources. This presents challenges of how to manage adaptive systems and how such management should be exercised by people, both average pervasive computing users and administrators of pervasive computing resources. This paper presents some of the issues involved in reconciling dynamic user-centric adaptation with the management of autonomic systems to meet high-level management policies. It discusses our architectural approach and presents some initial research results in addressing these issues.
暂无评论