Data warehouse views typically store large aggregate tables based on a subset of dimension attributes of the main data warehouse fact table. Aggregate views can be stored as 2n subviews of a data cube with n attributes. Methods have been proposed for selecting only some of the data cube views to materialize in order to speed up query response time, accommodate storage space constraint and reduc...

The fact that data is scattered over many tables causes many problems in the practice of data mining. To deal with this problem, one either constructs a single table by hand, or one uses a Multi-Relational Data Mining algorithm. In this paper, we propose a different approach in which the single table is constructed automatically using aggregate functions, which repeatedly summarise information ...

A central theme of the Semantic Web is that programs should be able to easily aggregate data from different sources. Unfortunately, even if two sites provide their data using the same data model and vocabulary, subtle differences in their use of terms and in the assumptions they make pose challenges for aggregation. Experiences with the TAP project reveal some of the phenomena that pose obstacl...

Many application domains depend on the collection of aggregate statistics from a large number of participants. In such situations, often the individual data points are not required. Indeed participants may wish to preserve the privacy of their specific data despite being willing to contribute to the aggregate statistics. We propose a protocol that allows a server to gather aggregate statistics,...

The integration of disparate biomedical data continues to be a challenge for drug discovery efforts. Semantic Web technologies provide the capability to more easily aggregate data and thus can be utilized to improve the efficiency of drug discovery. We describe an implementation of a Semantic Web infrastructure that utilizes the scalable Oracle RDF Data Model as the repository and Seamark Navig...

Many real-world planning problems require sophisticated reasoning about numeric resources, including sharing of resources by different actions. Constraintbased planners offer machinery to represent complex constraints and dependencies between actions. However, such planners usually consider a single partial plan at a time, and limit themselves with finding a feasible solution. Alternatively, pl...

The effort of data mining, especially in relation to association rules in real world business applications, is significantly important. Recently, association rules algorithms have been developed to cope with multidimensional data. In this paper we are concerned with mining association rules in data warehouses by focusing on its measurement of summarized data. We propose two algorithms: HAvg and...

The estimation of vote splitting in mixed-member electoral systems is a common problem in electoral studies, where the goal of researchers is to estimate individual voter transitions between parties on two different ballots cast simultaneously. Because the ballots are cast separately and secretly, however, voter choice on the two ballots must be recreated from separately tabulated aggregate dat...

This paper examines labour turnover using data from a survey of establishments in the UK conducted in 1990-91. Our work differs from most of the existing literature by using micro-level on establishments, whereas existing evidence uses micro-level data on individuals, or industry-level or aggregate data. The average turnover rate in our sample is 12.7% which is comparable to evidence from other...