HowtoFindRelevantDataforEffortEstimation.pptVIP

* * * How to Find Relevant Data for Effort Estimation ? 毛 可 2012-03-28 * Author Ekrem Kocaguneli ( Ph.d@WVU.LCSEE ) Tim Menzies Specialties: Data Mining, Effort Estimation 11’ TSE: Exploiting the Essential Assumptions of Analogy-Based Effort Estimation (TEAK) 11’ TSE: On the Value of Ensemble Effort Estimation 11’ ESEM: – 10’ ASE: When to Use Data from Other Projects for Effort Estimation(short) Pre: Relevancy Filtering for Defect Estimation * Motivation (Why) The Locality(1) Assumption Data divides best on one attribute 1. project type;e.g. embedded, etc; 2. development centers of developers; 3. development language 4. application type(MIS; GNC; etc); 5. targeted hardware platform; 6. in-house vs out sourced projects; If Locality(1) Hard to use data across these boundaries confined model, need to collect local data * Motivation (Why) The Locality(N) Assumption Data divides best on combination of attributes If Locality(N) Easier to use data across these boundaries * Work Cross-vs-Within + “relevancy filtering” for effort estimation Cross as good as within Companies can use other’s data for their estimates If they first apply “relevancy filtering” cross same as local * Technology (How) How to find relevant training data? * Technology (How) Variance Pruning * Technology (How) TEAK = ABE0 + Instance selection 11’ TSE: Exploiting the Essential Assumptions of Analogy-Based Effort Estimation ABE0 = ABE version 0 most commonly used Normalized numerics, 0 to 1 Euclidean distance equal weight to all attributes return median effort of k-nearest neighbors Instance selection smart way to adjust training data * Technology (How) TEAK is a variance-based instance selector It is built via GAC trees (binary for even) TEAK is a two-pass system First pass selects low variance relevant projects （instance selection） Second pass retrieves projects to estimate from （ instance retrieval ） Variance Pruning 10% * max ( σ2