A reputation-based trust model for agent societies

Trust and security issues are prevalent in agent societies, where agents are autonomously owned and operated in a networked environment. Nowadays, trust and reputation management is a promising approach to manage them. However, many reputation models su.ered from a major drawback – there is no mechanism to discourage agents from lying information when making a recommendation. Although some works do take into account of this issue, they usually do not penalize an agent for making poor referrals. Worse, some systems actually judge an agents referral reputation based on its service reputation. In situations where this is unacceptable, we need to have a mechanism where agents are not only discouraged from making poor referrals, but are also penalized when doing so. Towards this, we propose a reputation-based trust model that considers an agents referral reputation as a separate entity within the broader sense of an agents reputation. Our objective is not to replace any existing reputation mechanisms, but rather to complement and extend them.

SCLOPE: an algorithm for clustering data streams of categorical attributes

Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose SCLOPE, a novel algorithm based on CLOPErsquos intuitive observation about cluster histograms. Unlike CLOPE however, our algo- rithm is very fast and operates within the constraints of a data stream environment. In particular, we designed SCLOPE according to the recent CluStream framework. Our evaluation of SCLOPE shows very promising results. It consistently outperforms CLOPE in speed and scalability tests on our data sets while maintaining high cluster purity; it also supports cluster analysis that other algorithms in its class do not.

Insurance services in multi-agent systems

In a multi-agent environment, there is often the need for an agent to cooperate with others so as to ensure that a given task is achieved timely and cost-effectively. Present agent systems currently maximizes this through mechanisms such as trust and risk assessments. In this paper, we extend this mechanism by introducing the concept of insurance, in which the insurance agents act as a bridge between agents who require resources from others. Unlike traditional systems, agents purchase insurance so as to guarantee to have the requested resources during the task execution time and thus minimize the risk in task failure. The novelty of this proposal is that it ensures agents continuously to exchange resources and to seek maximum expected utility in a dynamic environment at the same time. Our experimental results confirm the feasibility of our approach.

ó-SCLOPE : clustering categorical streams using attribute selection

Clustering is a difficult problem especially when we consider the task in the context of a data stream of categorical attributes. In this paper, we propose σ-SCLOPE, a novel algorithm based on SCLOPE’s intuitive observation about cluster histograms. Unlike SCLOPE however, our algorithm consumes less memory per window and has a better clustering runtime for the same data stream in a given window. This positions σ-SCLOPE as a more attractive option over SCLOPE if a minor lost of clustering accuracy is insignificant in the application.

Agents and stream data mining: a new perspective

Many organizations struggle with the massive amount of data they collect. Today, data does more than serve as the ingredients for churning out statistical reports. They help support efficient operations in many organizations, and to some extent, data provide the competitive intelligence organizations need to survive in today's economy. Data mining can't always deliver timely and relevant results because data are constantly changing. However, stream-data processing might be more effective, judging by the Matrix project.

Integrating insurance services, trust and risk mechanisms into multi-agent systems

In multi-agent systems, there is often the need for an agent to cooperate with others so as to ensure that a given task is achieved timely and cost effectively. Currently multi-agent systems maximize this through mechanisms such as coalition formation, trust and risk assessments, etc. In this paper, we incorporate the concept of insurance with trust and risk mechanisms in multi-agent systems. The novelty of this proposal is that it ensures continuous sharing of resources while encouraging expected utility to be maximized in a dynamic environment. Our experimental results confirm the feasibility of our approach.

Buying and selling with insurance in open multi-agent marketplace

In this paper, we incorporate the insurance concept in buying and selling model for agents to trade in the open multi-agent marketplace. During buying, agents purchase insurance as a method to search for potential sellers and select their partners based on the information provided by insurance agents. During selling, agents purchase insurance as a method to protect themselves against potential risk. The insurance concept greatly simplifies the trading procedure in the open marketplace. The novelty of this proposal is that it ensures a dynamic trading environment while agents continue to seek maximum utility and being fully protected by insurance. Our experimental results confirm the feasibility of our approach.

A wavelet-based ammunition doppler radar system

Today’s state-of-the-art ammunition Doppler radars use the Fourier spectrogram for the joint time-frequency analysis of ammunition Doppler signals. In this paper, we implement the joint time-frequency analysis of ammunition Doppler signals based on the theory of wavelet packets. The wavelet-based approach is demonstrated on Doppler signals for projectile velocity measurement, projectile inbore velocity measurement and on modulated Doppler signal for projectile spin rate measurement. The wavelet-based representation with its good resolution in time and frequency and reasonable computational complexity as compared to the Fourier spectrogram is a good alternative for the joint time-frequency analysis of ammunition Doppler signals.

Wavelet packets for lighting-effects determination

This paper presents a system to determine lighting effiects within face images. The theories of multivariate discriminant analysis and wavelet packets transform are utilised to develop the proposed system. An extensive set of face images of different poses, illuminated from different angles, are used to train the system. The performance of the proposed system is evaluated by conducting experiments on different test sets, and by comparing its results against those of some existing counterparts.

Trading in open marketplace using trust and risk

In this paper, we propose buying and selling models for agents to trade in the open multi-agent marketplace. Unlike auctions, we take into account of the fact that agents trading in such open environments has to maximize their profits and at the same time, protect themselves from fraud and deception. We attempt to address this issue by incorporating the element of trust and risk management into our proposed buying and selling model. During buying, agents learn to select their partners based on the trustworthiness of the potential partner as well as its personal risk attitude. During selling, agents learn to increase the chances of winning a deal by adjusting their profit rate, which is a measure that considers both trust and risk. The novelty of this proposal is that it ensures agents continuing to seek maximum expected utility in a dynamic trading environment. Our experimental results confirm the feasibility of our approach.

Enhancing the effectiveness of clustering with spectra analysis

For many clustering algorithms, such as K-Means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters, that is, k, to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially true in text collections such as Web documents, images, or biological data. In an effort to improve the effectiveness of clustering, we seek the answer to a fundamental question: How can we effectively estimate the number of clusters in a given data set? We propose an efficient method based on spectra analysis of eigenvalues (not eigenvectors) of the data set as the solution to the above. We first present the relationship between a data set and its underlying spectra with theoretical and experimental results. We then show how our method is capable of suggesting a range of k that is well suited to different analysis contexts. Finally, we conclude with further  empirical results to show how the answer to this fundamental question enhances the clustering process for large text collections.

Dynamical systems for discovering protein complexes and functional modules from biological networks

Recent advances in high throughput experiments and annotations via published literature have provided a wealth of interaction maps of several biomolecular networks, including metabolic, protein-protein, and protein-DNA interaction networks. The architecture of these molecular networks reveals important principles of cellular organization and molecular functions. Analyzing such networks, i.e., discovering dense regions in the network, is an important way to identify protein complexes and functional modules. This task has been formulated as the problem of finding heavy subgraphs, the Heaviest k-Subgraph Problem (k-HSP), which itself is NPhard. However, any method based on the k-HSP requires the parameter k and an exact solution of k-HSP may still end up as a “spurious” heavy subgraph, thus reducing its practicability in analyzing large scale biological networks. We proposed a new formulation, called the rank-HSP, and two dynamical systems to approximate its results. In addition, a novel metric, called the Standard deviation and Mean Ratio (SMR), is proposed for use in “spurious” heavy subgraphs to automate the discovery by setting a fixed threshold. Empirical results on both the simulated graphs and biological networks have demonstrated the efficiency and effectiveness of our proposal.

Discovering frequent sets from data streams with CPU constraint

Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recognized that mining over streaming data requires the problem of limited computational resources to be adequately addressed. Since the arrival rate of data streams can significantly increase and exceed the CPU capacity, the machinery must adapt to this change to guarantee the timeliness of the results. We present an online algorithm to approximate a set of frequent patterns from a sliding window over the underlying data stream - given apriori CPU capacity. The algorithm automatically detects overload situations and can adaptively shed unprocessed data to guarantee the timely results. We theoretically prove, using probabilistic and deterministic techniques, that the error on the output results is bounded within a pre-specified threshold. The empirical results on various datasets also confirmed the feasiblity of our proposal.

A spectroscopy of texts for effective clustering

For many clustering algorithms, such as k-means, EM, and CLOPE, there is usually a requirement to set some parameters. Often, these parameters directly or indirectly control the number of clusters to return. In the presence of different data characteristics and analysis contexts, it is often difficult for the user to estimate the number of clusters in the data set. This is especially true in text collections such as Web documents, images or biological data. The fundamental question this paper addresses is: ldquoHow can we effectively estimate the natural number of clusters in a given text collection?rdquo. We propose to use spectral analysis, which analyzes the eigenvalues (not eigenvectors) of the collection, as the solution to the above. We first present the relationship between a text collection and its underlying spectra. We then show how the answer to this question enhances the clustering process. Finally, we conclude with empirical results and related work.

OWDEAH: Online Web Data Extraction based on Access History

Web data extraction systems are the kernel of information mediators between users and heterogeneous Web data resources. How to extract structured data from semi-structured documents has been a problem of active research. Supervised and unsupervised methods have been devised to learn extraction rules from training sets. However, trying to prepare training sets (especially to annotate them for supervised methods), is very time-consuming. We propose a framework for Web data extraction, which logged usersrsquo access history and exploit them to assist automatic training set generation. We cluster accessed Web documents according to their structural details; define criteria to measure the importance of sub-structures; and then generate extraction rules. We also propose a method to adjust the rules according to historical data. Our experiments confirm the viability of our proposal.