This paper provides a methodology for detecting management fraud using basic financial data. The methodology is based on support vector machines. An important aspect therein is a kernel that increases the power of the learning machine by allowing an implicit and generally nonlinear mapping of points, usually into a higher dimensional feature space. A kernel specific to the domain of finance is developed. This financial kernel constructs features shown in prior research to be helpful in detecting management fraud. A large empirical data set was collected, which included quantitative financial attributes for fraudulent and nonfraudulent public companies. Support vector machines using the financial kernel correctly labeled 80% of the fraudulent cases and 90.6% of the nonfraudulent cases on a holdout set. Furthermore, we replicate other leading fraud research studies using our data and find that our method has the highest accuracy on fraudulent cases and competitive accuracy on nonfraudulent cases. The results validate the financial kernel together with support vector machines as a useful method for discriminating between fraudulent and nonfraudulent companies using only publicly available quantitative financial attributes. The results also show that the methodology has predictive value because, using only historical data, it was able to distinguish fraudulent from nonfraudulent companies in subsequent years.management fraud, classification, support vector machines, financial event detection, kernel methods

No abstract

We explore data-driven methods for gaining insight into the dynamics of a two-population genetic algorithm (GA), which has been effective in tests on constrained optimization problems. We track and compare one population of feasible solutions and another population of infeasible solutions. Feasible solutions are selected and bred to improve their objective function values. Infeasible solutions are selected and bred to reduce their constraint violations. Interbreeding between populations is completely indirect, that is, only through their offspring that happen to migrate to the other population. We introduce an empirical measure of distance, and apply it between individuals and between population centroids to monitor the progress of evolution. We find that the centroids of the two populations approach each other and stabilize. This is a valuable characterization of convergence. We find the infeasible population influences, and sometimes dominates, the genetic material of the optimum solution. Since the infeasible population is not evaluated by the objective function, it is free to explore boundary regions, where the optimum is likely to be found. Roughly speaking, the No Free Lunch theorems for optimization show that all blackbox algorithms (such as Genetic Algorithms) have the same average performance over the set of all problems. As such, our algorithm would, on average, be no better than random search or any other blackbox search method. However, we provide two general theorems that give conditions that render null the No Free Lunch results for the constrained optimization problem class we study. The approach taken here thereby escapes the No Free Lunch implications, per se. Ó 2007 Published by Elsevier B.V.

No abstract

A major issue in value-function assessment is the possibility of receiving an indefinite response from a decision maker to a question about preferences. The conventional treatment requires a single, definite response from the decision maker. This approach either assumes that response error is zero or accepts the final solution as only approximate, without knowing how approximate it might be. In this paper we examine the issue of indefinite responses, define it more precisely, and present a method for incorporating it into decision making. The method is adaptive in that it is iterative and interactive with the decision maker who, at each iteration, is provided with information regarding the potential advantage of answering more trade-off questions and/or answering questions more carefully to reduce response m r . In contrast to other approaches that "force" rationality and decisiveness, we work with irrationality and indecisiveness on the part of the decision maker. The method is demonstrated for the case of concave, increasing value functions. Sub]cct A m Daision Analysis, Human Information Pmcessing, and Statistical Decision nmr)r