2 8 2 data reduction and reporting 227

... Create LIBREF, data set, and formats Data Management Join data sets, add variables, and subset data Analysis and Reporting Summarize, list, and plot data  18 Data Management and Reporting Made ... Shoes and Slipper 20 02 Sales Query 20 02 Shoes and Slipper sales: Sales Query where year = 20 02 and product = ‘Shoes’ or ‘Slipper’ Analysis and Reporting Tasks Once the data set is prepared and ... Query to restrict the data for northern region and sales from 1st Quarter 20 02 to 3rd Quarter 20 02 Chapter 2: The Business Model and Project Setup; Selecting Analysis and Reporting Tasks 17 Run...

Ngày tải lên: 03/07/2014, 16:06

... dimensionality reduction O Maimon, L Rokach (eds.), Data Mining and Knowledge Discovery Handbook, 2nd ed., DOI 10.1007/9 78- 0- 387 -09 82 3 -4_4, © Springer Science+Business Media, LLC 20 10 54 Christopher ... all such directions, and we cannot hope to uncover such structure using one dimensional projections 1 .8 1.6 1.4 1 .2 0 .8 0.6 0.4 0 .2 −1 −0 .8 −0.6 −0.4 −0 .2 0 .2 0.4 0.6 0 .8 Fig 4.1 Dotted line: ... Explorations Newsletter (20 02) 21 – 30 Wu X and Barbara D Modeling and imputation of large incomplete multidimensional datasets Proc of the 4-th Int Conference on Data Warehousing and Knowledge Discovery,...

Ngày tải lên: 04/07/2014, 05:21

... won't execute\n"; b1 = true; b2 = false; if(b1 && b2) cout

Ngày tải lên: 22/01/2014, 10:20

... 133, 514, 529 , 563 linear, 95, 185 , 21 0, 529 , 5 32, 564, 644, 744, 121 2, 127 3 logistic, 97, 21 8, 22 6, 527 , 531, 5 32, 645, 647, 84 9, 85 0, 10 32, 1154, 120 0, 120 1, 120 5, 121 2, 127 3 stepwise, 189 Regression,linear, ... 536, 541, 543, 5 48, 549, 603, 605–607, 614, 620 , 622 – 624 , 653, 655, 656, 659, 6 62, 82 6 , 84 6, 901, 10 12, 1014, 1 023 , 10 32, 1 126 , 1 127 , 11 72, 1175, 1177, 127 1 relational, 88 8, 89 0, 89 9, 901 Association ... 961, 9 72, 10 12, 11 18, 11 98, 127 3 CART, 510 CART (Classification and regression trees), 34, 151, 163, 164, 22 0, 22 2, 22 4 22 6, 89 9, 907, 987 , 990, 11 18, 11 98 Case-based reasoning (CBR), 1 121 Category...

Ngày tải lên: 04/07/2014, 05:21

... e-ISBN 9 78- 0- 387 -09 82 3 -4 DOI 10.1007/9 78- 0- 387 -09 82 3 -4 Springer New York Dordrecht Heidelberg London Library of Congress Control Number: 20 10931143 c Springer Science+Business Media, LLC 20 05, 20 10 ... 699 78 Ramat Aviv Israel maimon@eng.tau.ac.il Dr Lior Rokach Ben-Gurion University of the Negev Dept Information Systems Engineering 84 105 Beer-Sheva Israel liorrk@bgu.ac.il ISBN 9 78- 0- 387 -09 82 2 -7 ... Data Mining and Knowledge Discovery Handbook Second Edition Oded Maimon · Lior Rokach Editors Data Mining and Knowledge Discovery Handbook Second Edition 123 Editors Prof Oded...

Ngày tải lên: 04/07/2014, 05:21

... 1 189 64 NHECD - Nano Health and Environmental Commented Database Oded Maimon, Abel Browarnik 122 1 Part VIII Software 65 Commercial Data Mining Software ... Han 789 41 Mining High-Dimensional Data Wei Wang, Jiong Yang 80 3 42 Text Mining and Information Extraction Moty Ben-Dov, ... Salvatore Rinzivillo 85 5 45 Data Mining for Imbalanced Datasets: An Overview Nitesh V Chawla 87 5 46 Relational Data Mining Saˇo Dˇ eroski...

Ngày tải lên: 04/07/2014, 05:21

... Rokach (eds.), Data Mining and Knowledge Discovery Handbook, 2nd ed., DOI 10.1007/9 78- 0- 387 -09 82 3 -4_1, © Springer Science+Business Media, LLC 20 10 Oded Maimon and Lior Rokach mote data accessibility ... understanding phenomena from the data, analysis and prediction The accessibility and abundance of data today makes Knowledge Discovery and Data Mining a matter of considerable importance and necessity ... Discovery in Databases be determined This includes finding out what data is available, obtaining additional necessary data, and then integrating all the data for the knowledge discovery into one data...

Ngày tải lên: 04/07/2014, 05:21

... Intelligent Data Analysis, Volume 9, Number 2, 20 05b, pp 131–1 58 Rokach, L and Maimon, O., Clustering methods, Data Mining and Knowledge Discovery Handbook, pp 321 –3 52, 20 05, Springer Rokach, L and Maimon, ... learning tools and techniques, Morgan Kaufmann Pub, 20 05 Wu, X and Kumar, V and Ross Quinlan, J and Ghosh, J and Yang, Q and Motoda, H and McLachlan, G.J and Ng, A and Liu, B and Yu, P.S and others, ... data errors (Redman, 19 98) A manual O Maimon, L Rokach (eds.), Data Mining and Knowledge Discovery Handbook, 2nd ed., DOI 10.1007/9 78- 0- 387 -09 82 3 -4 _2, © Springer Science+Business Media, LLC 20 10...

Ngày tải lên: 04/07/2014, 05:21

... 20 02) , and outlier detection in multi-dimensional data sets is also addressed (Aggarwal and Yu, 20 01) 2 Data Cleansing 23 2. 3 GENERAL METHODS FOR DATA CLEANSING With all the above in mind, data ... detecting missing and incorrect data, and correcting errors Other recent work relating to data cleansing includes (Bochicchio and Longo, 20 03, Li and Fang, 1 989 ) Data Mining emphasizes data cleansing ... (Galhardas, 20 01) data cleansing is the process of eliminating the errors and the inconsistencies in data and solving the object identity problem Hernandez and Stolfo (19 98) define the data cleansing...

Ngày tải lên: 04/07/2014, 05:21

... Discovery and Data Mining; 20 00 August 20 -23 ; Boston, MA 29 0 -29 4 Levitin, A & Redman, T A Model of the Data (Life) Cycles with Application to Quality, Information and Software Technology 1995; 35(4) :21 7 -22 3 ... 1995; 35(4) :21 7 -22 3 Li, Z., Sung, S Y., Peng, S., & Ling, T W A New Efficient Data cleansing Method Proceedings of Database and Expert Systems Applications (DEXA 20 02) ; 20 02 September 2- 6; Aix-en-Provence, ... Dallas 427 -4 38 Redman, T The Impact of Poor Data Quality on the Typical Enterprise, Communications of the ACM 19 98; 41 (2) :79- 82 Rokach, L., Maimon, O (20 05), Clustering Methods, Data Mining and Knowledge...

Ngày tải lên: 04/07/2014, 05:21

... 8} and for Table 3.15 and B = A, KA (1) = {1, 3, 4, 5, 8} ∩ {1, 3, 6, 8} = {1, 3, 8} , KA (2) = {2, 3, 8} ∩ {1, 2, 4, 5, 6, 8} ∩ {2, 4, 5, 7, 8} = {2, 8} , KA (3) = {1, 3, 5, 7} ∩ {1, 3, 6, 8} ... 3, 4, 5, 8} ∩ {1, 2, 4, 5, 6, 8} ∩ {2, 4, 5, 7, 8} = {4, 5, 8} , KA (5) = {1, 3, 4, 5, 8} ∩ {2, 4, 5, 7, 8} = {4, 5, 8} , KA (6) = {3, 6, 7, 8} ∩ {1, 2, 4, 5, 6, 8} ∩ {1, 3, 6, 8} = {6, 8} , KA (7) ... (Dardzinska and Ras, 20 03A,Dardzinska and Ras, 20 03B) Learning missing attribute values from summary constraints was reported in (Wu and Barbara, 20 02, Wu and Barbara, 20 02) Yet another approach to handling...

Ngày tải lên: 04/07/2014, 05:21

... Qrr ≡ A+A−1 /2 BB A−1 /2 ≡ UQΛQUQ , then the desired matrix of orthogonal column eigenvectors is A −1 /2 Vmr ≡ A−1/2UQΛQ (4 .24 ) B (so that Kmm = V ΛQV and V V = 1rr ) (Fowlkes et al., 20 04) Although ... the right hand side where d m and d > r, and approximate the eigenvector of the full kernel matrix Kmm by evaluating the left hand rows (and hence columns) are linearly independent, and suppose ... and can be written as K = ZZ where Z ∈ Mmr and Z is also of rank r (Horn and Johnson, 1 985 ) Order the row vectors in Z so that the first r are linearly independent: ˜ this just reorders rows and...

Ngày tải lên: 04/07/2014, 05:21

... the latter can be reduced to O(hm2 log m) where h is a heap size (Silva and Tenenbaum, 20 02) Landmark Isomap simply employs landmark MDS (Silva and Tenenbaum, 20 02) to addresses this problem, computing ... clustering algorithms (such as K-means) on the preprocessed data can work well (Shi and Malik, 20 00, Meila and Shi, 20 00, Ng et al., 20 02) If a graph 78 Christopher J.C Burges is partitioned into two disjoint ... coordinates, we have b − (f− E), and the coordinates −1 /2 ¯ − f); this reproduces the form given in of the embedded test point are Λ U (E (Silva and Tenenbaum, 20 02) Landmark MDS has two significant...

Ngày tải lên: 04/07/2014, 05:21

... Computation, 10(5): 129 9–1319, 19 98 J Shi and J Malik Normalized cuts and image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (8) :88 8–905, 20 00 C.E Spearman ’General ... University Press, 2nd edition, 19 92 S.T Roweis and L.K Saul Nonlinear dimensionality reduction by locally linear embedding Science, 29 0 (22 ) :23 23 23 26, 20 00 I.J Schoenberg Remarks to maurice frechet’s ... Intelligence, 26 (2) , 20 04 J.H Friedman and W Stuetzle Projection pursuit regression Journal of the American Statistical Association, 76(376) :81 7– 82 3 , 1 981 J.H Friedman, W Stuetzle, and A Schroeder...

Ngày tải lên: 04/07/2014, 05:21

... (MEDINFO 20 04), San Francisco, CA, September 20 04, IOS Press, pp 28 2 28 6 Blum P and Langley, P Selection Of Relevant Features And Examples In Machine Learning, Artificial Intelligence, 1997;97: 24 5 -27 1 ... Press, 1996 Chizi, B and Maimon, O “On Dimensionality Reduction of High Dimensional Data Sets”, In “Frontiers in Artificial Intelligence and Applications” IOS press, pp 23 0 -23 6, 20 02 Cohen S., Rokach ... Science, Springer, pp 1 78- 196, 20 02 Maimon, O and Rokach, L., Decomposition Methodology for Knowledge Discovery and Data Mining: Theory and Applications, Series in Machine Perception and Artificial Intelligence...

Ngày tải lên: 04/07/2014, 05:21

... Section 6 .2 presents a O Maimon, L Rokach (eds.), Data Mining and Knowledge Discovery Handbook, 2nd ed., DOI 10.1007/9 78- 0- 387 -09 82 3 -4_6, © Springer Science+Business Media, LLC 20 10 1 02 Ying Yang, ... quantitative data into qualitative data Data Mining applications often involve quantitative data However, there exist many learning algorithms that are primarily oriented to handle qualitative data (Kerber, ... effective (Catlett, 1991, Kerber, 19 92, Richeldi and Rossotto, 1995, Frank and Witten, 1999) Hence discretization has long been an active topic in Data Mining and knowledge discovery Many discretization...

Ngày tải lên: 04/07/2014, 05:21

... (Kaufman and Rousseeuw, 1990, Ng and Han, 1994, Ramaswamy et al., 20 00, Barbara and Chen, 20 00, Shekhar and Chawla, 20 02, Shekhar and Lu, 20 01, Shekhar and Lu, 20 02, Acuna and Rodriguez, 20 04) Hu and ... measures and are capable of handling large databases (Knorr and Ng, 1997, Knorr and Ng, 19 98, Fawcett and Provost, 1997, Williams and Huang, 1997, Mouchel and Schonlau, 19 98, Knorr et al., 20 00, ... from the entire population (Schiffman et al., 1 981 ,Ng and Han, 1994, Shekhar and Chawla, 20 02, Shekhar and Lu, 20 01, Shekhar and Lu, 20 02, Lu et al., 20 03) Some of the above-mentioned classes are...

Ngày tải lên: 04/07/2014, 05:21

... Discovery KDD, 21 9 -22 2, 1997 Knorr E., Ng R., ”Algorithms for mining distance-based outliers in large datasets,” In Proc 24 th Int Conf Very Large Data Bases (VLDB), 3 92- 403, 24 27, 19 98 7 Outlier ... Hall, 19 92 Johnson T., Kwok I., Ng R., ”Fast Computation of 2- Dimensional Depth Contours,” In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 22 4 -22 8 AAAI ... Conference on Knowledge Discovery and Data- mining (KDD 98) , 189 –193, 19 98 Fawcett T., Provost F., ”Adaptive fraud detection,” Data- mining andKnowledge Discovery, 1(3), 29 1–316, 1997 Ferguson T S.,...

Ngày tải lên: 04/07/2014, 05:21