Non-monotone averaging aggregation

We advance the theory of aggregation operators and introduce non-monotone aggregation methods based on minimization of a penalty for inputs disagreements. The application in mind is processing data sets which may contain noisy values. Our aim is to filter out noise while at the same time preserve signs of unusual values. We review various methods of robust estimators of location, and then introduce a new estimator based on penalty minimisation.

Reliable aggregation on network traffic for web based knowledge discovery

The web is a rich resource for information discovery, as a result web mining is a hot topic. However, a reliable mining result depends on the reliability of the data set. For every single second, the web generate huge amount of data, such as web page requests, file transportation. The data reflect human behavior in the cyber space and therefore valuable for our analysis in various disciplines, e.g. social science, network security. How to deposit the data is a challenge. An usual strategy is to save the abstract of the data, such as using aggregation functions to preserve the features of the original data with much smaller space. A key problem, however is that such information can be distorted by the presence of illegitimate traffic, e.g. botnet recruitment scanning, DDoS attack traffic, etc. An important consideration in web related knowledge discovery then is the robustness of the aggregation method , which in turn may be affected by the reliability of network traffic data. In this chapter, we first present the methods of aggregation functions, and then we employe information distances to filter out anomaly data as a preparation for web data mining.

Aggregation of preferences in recommender systems

This chapter gives an overview of aggregation functions toward their use in recommender systems. Simple aggregation functions such as the arithmetic mean are often employed to aggregate user features, item ratings, measures of similarity, etc., however many other aggregation functions exist which could deliver increased accuracy and flexibility to many systems. We provide definitions of some important families and properties, sophisticated methods of construction, and various examples of aggregation functions in the domain of recommender systems.

Aggregation for Atanassov's intuitionistic and interval valued fuzzy sets: the median operator

Atanassov's intuitionistic fuzzy sets (AIFS) and interval valued fuzzy sets (IVFS) are two generalizations of a fuzzy set, which are equivalent mathematically although different semantically. We analyze the median aggregation operator for AIFS and IVFS. Different mathematical theories have lead to different definitions of the median operator. We look at the median from various perspectives: as an instance of the intuitionistic ordered weighted averaging operator, as a Fermat point in a plane, as a minimizer of input disagreement, and as an operation on distributive lattices. We underline several connections between these approaches and summarize essential properties of the median in different representations.

Predicting protein functions from PPI networks using functional aggregation

Predicting protein functions computationally from massive protein–protein interaction (PPI) data generated by high-throughput technology is one of the challenges and fundamental problems in the post-genomic era. Although there have been many approaches developed for computationally predicting protein functions, the mutual correlations among proteins in terms of protein functions have not been thoroughly investigated and incorporated into existing prediction methods, especially in voting based prediction methods. In this paper, we propose an innovative method to predict protein functions from PPI data by aggregating the functional correlations among relevant proteins using the Choquet-Integral in fuzzy theory. This functional aggregation measures the real impact of each relevant protein function on the final prediction results, and reduces the impact of repeated functional information on the prediction. Accordingly, a new protein similarity and a new iterative prediction algorithm are proposed in this paper. The experimental evaluations on real PPI datasets demonstrate the effectiveness of our method.

The relationship between pre-sale price estimates and the hammer price for Australian paintings sold at auction

Realized price for paintings auctioned can systematically differ from prior estimates. We need to understand why experts get it wrong. This paper uses an econometric approach to investigate how pre-sales price estimates are formed and the impact that they have in determining auction prices for Australian paintings.

Better off dead? Prices realised for Australian paintings sold at auction

Using auction sales data on Australian paintings over the period 1995 and 2003 we investigate the relationship between artists‟ living status and the price of paintings sold at auction. For deceased artists we consider the time since their death and for living artists their conditional life expectancy. Hedonic regression analysis is applied separately to the data on Indigenous and non-Indigenous paintings. Comparing the modelling results across Indigenous and non-Indigenous paintings we see evidence of two different patterns of response to an artist‟s living status. Both yield non-linear impacts but for Indigenous paintings these are quadratic and for non-Indigenous they are quartic. Thus the response to living status in the more recent market for Indigenous paintings is different to the more established market for non-Indigenous paintings. Whilst the responses differ for the two types of paintings, in answer to the question posed and in terms of the price of a painting at auction an artist is better off long dead or close to death.

Neural network ensemble : evaluation of aggregation algorithms for electricity demand forecasting

This paper examines and analyzes different aggregation algorithms to improve accuracy of forecasts obtained using neural network (NN) ensembles. These algorithms include equal-weights combination of Best NN models, combination of trimmed forecasts, and Bayesian Model Averaging (BMA). The predictive performance of these algorithms are evaluated using Australian electricity demand data. The output of the aggregation algorithms of NN ensembles are compared with a Naive approach. Mean absolute percentage error is applied as the performance index for assessing the quality of aggregated forecasts. Through comprehensive simulations, it is found that the aggregation algorithms can significantly improve the forecasting accuracies. The BMA algorithm also demonstrates the best performance amongst aggregation algorithms investigated in this study.