Data Mining for Very Busy People

Most modern businesses can access mountains of data electronically; the trick is effectively using that data. In practice, this means summarizing large data sets to find the data that really matters. Most data miners are zealous hunters seeking detailed summaries and generating extensive and lengthy descriptions. The authors take a different approach and assume that busy people don't need, or can't use complex models. Rather, they want only the data they need to achieve the most benefits. Instead of finding extensive descriptions of things, their data mining tool hunts for a minimal difference set between things because they believe a list of essential differences is easier to read and understand than detailed descriptions.

[1]  Tim Menzies,et al.  Model-based tests of truisms , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[2]  Ada Wai-Chee Fu,et al.  Mining association rules with weighted items , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Tim Menzies,et al.  Many Maybes Mean (Mostly) the Same Thing , 2004 .

[5]  Tim Menzies,et al.  Converging on the optimal attainment of requirements , 2002, Proceedings IEEE Joint International Conference on Requirements Engineering.

[6]  Ellis Horowitz,et al.  Software Cost Estimation with COCOMO II , 2000 .

[7]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  Raymond J. Madachy,et al.  Heuristic Risk Assessment Using Cost Factors , 1997, IEEE Softw..

[10]  Jack P. C. Kleijnen.  Sensitivity analysis and related analysis : A survey of statistical techniques , 1995 .

[11]  G Gigerenzer,et al.  Reasoning the fast and frugal way: models of bounded rationality. , 1996, Psychological review.

[12]  Stephen D. Bay,et al.  Detecting change in categorical data: mining contrast sets , 1999, KDD '99.

[13]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[14]  Robert C. Holte,et al.  Very Simple Classification Rules Perform Well on Most Commonly Used Datasets , 1993, Machine Learning.

[15]  Gerd Gigerenzer,et al.  Reasoning the Fast and Frugal Way , 2002 .

[16]  Ron Kohavi,et al.  Wrappers for Feature Subset Selection , 1997, Artif. Intell..

[17]  Martin S. Feather,et al.  Combining the best attributes of qualitative and quantitative risk management tool support , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[18]  Tim Menzies,et al.  Practical large scale what-if queries: case studies with software risk assessment , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.

[19]  Michael E. Fagan.  Advances in software inspections , 1986, IEEE Transactions on Software Engineering.

[20]  Tim Menzies,et al.  Condensing Uncertainty via Incremental Treatment Learning , 2003 .