6400431
Applying rough sets to market timing decisions
A lot of research has been done to predict economic development. The problem studied here is about the stock prediction for use of investors. More specifically, the stock market's movements will be analyzed and predicted. We wish to retrieve knowledge that could guide investors on when to buy and sell. 
 
Through a detailed case study on trading S&P 500 index, rough sets is shown to be an applicable and effective tool to achieve this goal. Some problems concerning time series transformation, indicator selection, trading system building in real implementation are also discussed.
9193368
Economic and financial prediction using rough sets model
Abstract A state-of-the-art review of the literature related to economic and financial prediction using rough sets model is presented, with special emphasis on the business failure prediction, database marketing and financial investment. These three applications require the accurate prediction of the future states based on the identification of patterns in the historical data. In addition, the historical data are in the format of a multi-attribute information table. All these conditions suit the rough sets model, an effective tool for multi-attribute classification problems. The different rough sets models and issues concerning the implementation of rough sets model – indicator selection, discretization and validation test, are also discussed in this paper. This paper will demonstrate that rough sets model is applicable to a wide range of practical problems pertaining to economic and financial prediction. In addition, the results show that the rough sets model is a promising alternative to the conventional methods for economic and financial prediction.
6411349
A Modified Chi2 Algorithm for Discretization
Since the ChiMerge algorithm was first proposed by Kerber (1992), it has become a widely used and discussed discretization method. The Chi2 algorithm is a modification to the ChiMerge method. It automates the discretization process by introducing an inconsistency rate as the stopping criterion and it automatically selects the significance value. In addition, it adds a finer phase aimed at feature selection to broaden the applications of the ChiMerge algorithm. However, the Chi2 algorithm does not consider the inaccuracy inherent in ChiMerge's merging criterion. The user-defined inconsistency rate also brings about inaccuracy to the discretization process. These two drawbacks are first discussed in this paper and modifications to overcome them are then proposed. By comparison, results with the original Chi2 algorithm using C4.5, the modified Chi2 algorithm, performs better than the original Chi2 algorithm. It becomes a completely automatic discretization method.
19118237
A machine learning approach for the curation of biomedical literature: KDD Cup 2002 (task 1)
In this paper, we present an automated text classification system for the classification of biomedical papers. This classification is based on whether there is experimental evidence for the expression of molecular gene products for specified genes within a given paper. The system performs pre-processing and data cleaning, followed by feature extraction from the raw text. It subsequently classifies the paper using the extracted features with a Naïve Bayes Classifier. Our approach has made it possible to classify (and curate) biomedical papers automatically, thus potentially saving considerable time and resources.
811735
Classifying Market States with WARS
In this paper, a new indicator - WARS (Weighted Accumulated Reconstruction Series) at classifying the state of financial market, either trending state or mean-reverting state, was presented. Originated from the computation of Entropy, this new indicator was found to be able to reflect the market behavior accurately and easily. The algorithm of generating WARS and its meaning related to Entropy were introduced and some comparison results between WARS and the Daily Profit Curve were listed. As a new indicator, WARS also can be used to build a trading system - to provide buy, sell and hold signals. Through the application on S&P 500 index, it was verified to be effective and was a promising indicator.
2847866
A Machine Learning Approach for the Curation of Biomedical Literature
In the field of the biomedical sciences there exists a vast repository of information located within large quantities of research papers. Very often, researchers need to spend considerable amounts of time reading through entire papers before being able to determine whether or not they should be curated (archived). In this paper, we present an automated text classification system for the classification of biomedical papers. This classification is based on whether there is experimental evidence for the expression of molecular gene products for specified genes within a given paper. The system performs pre-processing and data cleaning, followed by feature extraction from the raw text. It subsequently classifies the paper using the extracted features with a Naive Bayes Classifier. Our approach has made it possible to classify (and curate) biomedical papers automatically, thus potentially saving considerable time and resources. The system proved to be highly accurate, and won honourable mention in the KDD Cup 2002 task 1.
13929087
Availability prediction and modeling of high mobility OSCAR cluster
Since the initial introduction of open source cluster application resources (OSCAR), this software package has been a well-accepted choice for building high performance computing systems. As it continues to be applied to mission-critical environments, high availability (HA) features therefore are needed to be included in OSCAR cluster. In this paper, we provide a HA solution for OSCAR cluster. As a widely used technique in HA solutions, component redundancy is adopted to improve the system availability. Based on the proposed architecture, we develop a detailed failure-repair model for predicting the availability of HA OSCAR cluster. stochastic reward nets (SRN) are used to model the behavior of the system. We specify our SRN model to stochastic Petri net package, describe and compute several interesting output measures that characterize availability features of HA OSCAR cluster.
33719729
New Algorithms for Efficient Mining of Association Rules
Abstract Discovery of association rules is an important data mining task. Several algorithms have been proposed to solve this problem. Most of them require repeated passes over the database, which incurs huge I/O overhead and high synchronization expense in parallel cases. There are a few algorithms trying to reduce these costs. But they contain weaknesses such as often requiring high pre-processing cost to get a vertical database layout, containing much redundant computation in parallel cases, and so on. We propose new association mining algorithms to overcome the above drawbacks, through minimizing the I/O cost and effectively controlling the computation cost. Experiments on well-known synthetic data show that our algorithms consistently outperform a priori, one of the best algorithms for association mining, by factors ranging from 2 to 4 in most cases. Also, our algorithms are very easy to be parallelized, and we present a parallelization for them based on a shared-nothing architecture. We observe that our parallelization develops the parallelism more sufficiently than two of the best existing parallel algorithms.
23994030
Fast Association Discovery in Derivative Transaction Collections
Abstract. Association discovery from a transaction collection is an important data-mining task. We study a new problem in this area whose solution can provide users with valuable association rules in some relevant collections: association discovery in derivative transaction collections. In this problem, we are given association rules in two transaction collections D1 and D2, and aim to find new association rules in derivative transaction collections D1∖D2, D1∩D2, D2∖D1 and D1∪D2. Direct application of existing algorithms can solve this problem, but in an expensive way. We propose an efficient solution through making full use of already discovered information, taking advantage of the relationships existing among relevant collections, and avoiding unnecessary but expensive support-counting operations by scanning databases. Experiments on well-known synthetic data show that our solution consistently outperforms the naive solution by factors from 2 to 3 in most cases. We also propose an efficient parallelization of our approach, as parallel algorithms are often interesting and necessary in the area of data mining.
14826038
A Spatio-Temporal Modeling Method for Shape Representation
The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected three dimensional (3D) objects. Because SPHARM based 3D models can derive functional information analysis and classify different pathological symptoms, it has been used in many applications in biomedical image computing. There is an urgent requirement for efficient spatio-temporal shape modeling to represent the dynamic anatomical structures in many applications (e.g., medical image analysis, geospatial information systems). In this paper we propose a novel real spherical harmonics based spatio-temporal shape modeling method to efficiently and flexibly represent the shapes sequence of anatomical structures in medical images. Our method works well on the simply connected 3D objects and the effectiveness of our approach is demonstrated through theoretic and experimental exploration of a set of medical image applications. Furthermore, an evaluation criterion for spatio-temporal shape modeling efficiency is proposed and the comparison results showed the good performance of our method.
17699029
Spherical parameterization for 3D surface analysis in volumetric images
We propose a new spherical parameterization algorithm for general genus-zero surfaces that aims to control the area and length distortions at the same time. Prior work either considers only the length distortion or applies only to volumetric surfaces. Our algorithm starts from an initial parameterization, performs local and global smoothing steps alternately to improve the mapping quality, and converges to the solution. The local method minimizes the area distortion at a local submesh by solving a linear system as well as controls the length distortion. The global method attempts to reduce the area distortion by equalizing its distribution over the whole sphere. We perform experimental studies showing the effectiveness of the technique. Our new algorithm has many applications in medical image analysis, computer vision, graphics and multimedia databases.