... Nội dung 2. 1 Tổng quan giai đoạn tiền xử lý liệu 2.2 Tóm tắt mô tả liệu 2. 3 Làm liệu 2. 4 Tích hợp liệu 2. 5 Biến đổi liệu 2. 6 Thu giảm liệu 2. 7 Rời rạc hóa liệu 2. 8 Tạo phân ... Springer-Verlag, 20 06 [5] ZhaoHui Tang, Jamie MacLennan, Data Mining with SQL Server 20 05”, Wiley Publishing, 20 05 [6] Oracle, Data Mining Concepts”, B28 129 -01, 20 08 [7] Oracle, Data Mining ... 23 2. 3 Làm liệu Xử lý liệu không quán Định nghĩa liệu không quán Dữ liệu ghi nhận khác cho đối tượng/thực thể discrepancies from inconsistent data representations 20 04/ 12/ 25 25 / 12/ 2004...
... Algorithm (cont.) Push (val DataIn ) Pushes new data into the stack Pre DataIn contains data to be pushed Post If stack is not full, DataIn has been pushed in; otherwise, ... 21 Top Algorithm (cont.) Top (ref DataOut ) Retrieves data on the top of the stack without changing the stack Pre none Post if the stack is not empty, DataOut receives data ... success end Pop 29 Top Stack Top(ref DataOut ) // Specifications here are similar to specifications for Linked Stack if (count = 0) return underflow else DataOut = data[ top] return...
... case return PrintReverse(head->link) // recursive case write (head- >data) End PrintReverse 21 Factorial: A recursive Definition 22 Iterative Solution Algorithm IterativeFactorial (val n ) ... = NULL) // stopping case return write (head- >data) Print(head->link) // recursive case End Print 18 Print List in Reverse 19 Print List in Reverse 20 Print List in Reverse Algorithm PrintReverse(val ... 13 Recursion 14 Print List 10 14 20 15 Print List A list is • empty, or • consists of an element and a sublist, where sublist is a list 16 Print List 10 14 20 17 Print List Algorithm Print(val...
... bushy tree) 2i+1 2i +2 23 Contiguous Implementation of Binary Tree Record Data Parent Flag End Record BinaryTree Data End BinaryTree Data A B ... BreadthFirstTraverse (refOperation(ref Data )) 16 17 18 19 20 21 22 Contiguous Implementation of Binary Tree BinaryTree Data End BinaryTree A B C D E F G ... (ref DataOut ) Insert (val DataIn ) Remove (val key ) Depend on various types of binary trees (BST, AVL, 2d-tree) Retrieve (ref DataOut...