chapter 2 implementing complex data structures

... p1 p2 p3 p4 p1 p3 p4 p2 0 y 1 p1 p1 p2 p3 p4 x 2. 828 3.1 62 5.099 p2 2. 828 1.414 3.1 62 p3 3.1 62 1.414 p4 5.099 3.1 62 Distance Matrix © Tan,Steinbach, Kumar Introduction to Data Mining 50 Minkowski ... to Data Mining Types of data sets Record – Data Matrix – Document Data – Transaction Data Graph – World Wide Web – Molecular Structures Ordered – Spatial Data – Temporal Data – Sequential Data ... Introduction to Data Mining 19 Ordered Data Spatio-Temporal Data Average Monthly Temperature of land and ocean © Tan,Steinbach, Kumar Introduction to Data Mining 20 Data Quality What kinds of data quality...

Ngày tải lên: 15/03/2014, 09:20

... 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...

Ngày tải lên: 23/01/2013, 22:17

Ngày tải lên: 17/12/2013, 15:18

... "Enter result (1 = pass, = fail): "; 19 cin >> result;  20 03 Prentice Hall, Inc All rights reserved 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 // if result 1, increment passes; if/else nested ... = 05; // interest rate  20 03 Prentice Hall, Inc All rights reserved 18 19 20 21 22 23 24 25 26 27 28 29 30 31 // output table column heads cout

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

... remainder = remainder % 5; //find nickel rolls nickelR = remainder / 2; remainder = remainder %2; //find penny rolls pennyR = remainder *2; //display results cout

Ngày tải lên: 20/02/2014, 08:20

... Min Value byte short int long bits 16 bits 32 bits 64 bits 127 - 128 32, 767 - 32, 768 -2, 147,483,648 2, 147,483,647 < -9 x 1018 > x 1018 float double 32 bits 64 bits +/- 3.4 x 1038 with significant ... read data of particular types • See GasMileage.java (page 92) © 20 04 Pearson Addison-Wesley All rights reserved 2- 48 Summary • Chapter focused on:       character strings primitive data ... light bulb being on or off © 20 04 Pearson Addison-Wesley All rights reserved 2- 23 Outline Character Strings Variables and Assignment Primitive Data Types Expressions Data Conversion Interactive...

Ngày tải lên: 06/03/2014, 10:21

... 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...

Ngày tải lên: 06/03/2014, 17:20

... operands have been processed 12 Evaluate a Postfix Expression Postfix Postfix 4+6 =10 24 6+*5- 24 6+*5- 10 10 *2 = 20 24 6+*5- 24 6+*5- 24 6+*5- 24 6+*5- 20 24 6+*5- 20 20 -5 = 15 24 6+*5- 15 Infix to Postfix ... Uses Stack ADT 22 Goal Seeking (cont.) Algorithm GoalSeeking1 12 10 12 11 12 12 (8) (9) (10) (11) ( 12) (1) 12 12 (2) (3) (4) 13 14 17 15 17 16 17 (13) (14) (15) 12 12 (5) (6) 12 (7) Destination ... problem (1,1) (1 ,2) (2, 3) Dead end (a) (3 ,2) Start (2, 4) (1,3) (1,4) (Dead end b) Start node End of unsuccessful path One solution is found (path contains nodes) (4 ,2) (3,1) (2, 4) Two nodes contain...

Ngày tải lên: 06/03/2014, 17:20

... hash( 121 267) = 121 267 MOD 307 + = + = Cao Hoang Tru CSE Faculty - HCMUT 18 01 December 20 08 Digit Extraction Address = selected digits from Key • Example: 3794 52 121 267 378845 16 025 2 045 128 Cao ... the size of the Key2 is too large • Variations: use only a portion of the key 3794 52: 379 * 379 = 143641 → 364 121 267: 121 * 121 = 014641 → 464 045 128 : 045 * 045 = 0 020 25 → 20 2 Cao Hoang Tru CSE ... - HCMUT 26 01 December 20 08 Pseudorandom • Example: Key = 121 267 Address a = 17 c=7 listSize = 307 = ((17* 121 267 + 7) MOD 307 + = (20 61539 + 7) MOD 307 + = 20 61546 MOD 307 + = 41 + = 42 Cao Hoang...

Ngày tải lên: 06/03/2014, 17:20

... 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...

Ngày tải lên: 15/03/2014, 17:20

... 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...

Ngày tải lên: 15/03/2014, 17:20

... InsertElement (val DataIn ) DeleteMin (ref MinData ) RetrieveMin (ref MinData ) RetrieveMax (ref MaxData ) ... loop (heap is not full) AND (more data in listOfData) listOfData.Retrieve(count, newData) data[ count] = newData ReheapUp( count) count = count + if (count < listOfData.Size() ) return overflow else ... return underflow else MinData = Data[ 0] Data[ 0] = Data[ count -1] count = count - ReheapDown(0, count -1) return success End DeleteHeap 16 DeleteHeap (ref MinData ) // Iterative...

Ngày tải lên: 15/03/2014, 17:20

... SortSegment 22 Insertion Sort Efficiency 23 Selection Sort 24 Straight Selection Sort 25 Straight Selection Sort 26 Straight Selection Sort 27 Straight Selection Sort 28 Straight Selection Sort 29 Straight ... loop (current < count) temp = data[ current] walker = current - k loop (walker >=0) AND (temp.key < data[ walker].key) data[ walker + k] = data[ walker] walker = walker – k data[ walker + k] = temp current ... datacurrent walker = current-1 loop (walker >=0) AND (temp.key < datawalker.key) datawalker+1 = datawalker walker = walker -1 datawalker+1 = temp current = current + End InsertionSort 13 Shell...

Ngày tải lên: 15/03/2014, 17:20

... newData , ref median , ref rightBranch ) Return overflow, duplicate_error, success if (subroot = NULL) median = newData rightbranch = NULL result = overflow else 28 ... (val newData ) (local variable: median , rightBranch , newroot , result ) Return duplicate_error, success result = recursiveInsert (root, newData, ... subroot , val newData , ref median , ref rightBranch ) // else, local variables: extraEntry, extraBranch if (SearchNode (subroot, newData, position) = success)...

Ngày tải lên: 15/03/2014, 17:20

... overflow 78 63 42 74 16 85 97 11 14 19 45 21 20 42 11 14 21 19 30 57 20 21 78 63 74 85 97 45 42 Insert 52, 30, 21 16 57 63 42 16 78 45 74 52 85 97 11 14 19 21 21 20 57 30 45 52 63 78 85 74 overflow ... HCMUT 21 14 42 45 63 42 45 63 42 45 63 45 63 21 14 21 42 14 21 42 14 21 23 17 November 20 08 Balance Borrow from left Original node Shift entries right Rotate parent data down Rotate data up ... Faculty - HCMUT 17 November 20 08 B-Trees 42 16 11 14 17 19 20 21 21 58 22 23 24 45 52 63 65 74 76 78 81 79 93 85 87 94 m=5 Cao Hoang Tru CSE Faculty - HCMUT 17 November 20 08 97 B-Tree Insertion...

Ngày tải lên: 15/03/2014, 17:20

... initialize total gradeCounter = 1; // initialize loop counter © 20 03 Prentice Hall, Inc All rights reserved 23 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 // processing phase while ( gradeCounter ... 2 Chapter - Control Structures Outline 2. 16 2. 17 2. 18 2. 19 2. 20 2. 21 switch Multiple-Selection Structure do/while Repetition Structure ... grades were entered” • Next: C++ program © 20 03 Prentice Hall, Inc All rights reserved 1 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 // Fig 2. 9: fig 02_ 09.cpp // Class average program with sentinel-controlled...

Ngày tải lên: 19/03/2014, 09:20

... Jan 14, 20 05 2. 20 Silberschatz, Galvin and Gagne 20 05 Solaris 10 dtrace Following System Call Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 21 Silberschatz, Galvin and Gagne 20 05 System ... Edition, Jan 14, 20 05 2. 26 Silberschatz, Galvin and Gagne 20 05 MS-DOS Layer Structure Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 27 Silberschatz, Galvin and Gagne 20 05 Layered Approach ... Edition, Jan 14, 20 05 2. 28 Silberschatz, Galvin and Gagne 20 05 Layered Operating System Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 29 Silberschatz, Galvin and Gagne 20 05 UNIX UNIX...

Ngày tải lên: 13/05/2014, 00:36

... BindinhSource ID, Name… Dataset (Rows) Dataset (Rows) Dataset (Rows) Dataset (Rows) Dataset (Rows) Lesson 2: Implementing Data- Bound Controls Binding Controls to Data – Simple data binding: displaying ... with the Data Sources Wizard What is Data- Bound controls? – Bound and Un-Bound mode ID, Name… – – Position??? Dataset (Rows) Dataset (Rows) Dataset (Rows) Dataset (Rows) Dataset (Rows) Data- bound ... Chapter Lesson 1: Creating a Data- Bound Form with the Data Sources Wizard Lesson 2: Implementing Data- Bound Controls Lesson 3: Working with the DataGridView Lesson 1: Creating a Data- Bound...

Ngày tải lên: 13/05/2014, 12:19

... Jan 14, 20 05 2. 20 Silberschatz, Galvin and Gagne 20 05 Solaris 10 dtrace Following System Call Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 21 Silberschatz, Galvin and Gagne 20 05 System ... Edition, Jan 14, 20 05 2. 26 Silberschatz, Galvin and Gagne 20 05 MS-DOS Layer Structure Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 27 Silberschatz, Galvin and Gagne 20 05 Layered Approach ... Edition, Jan 14, 20 05 2. 28 Silberschatz, Galvin and Gagne 20 05 Layered Operating System Operating System Concepts – 7th Edition, Jan 14, 20 05 2. 29 Silberschatz, Galvin and Gagne 20 05 UNIX UNIX...

Ngày tải lên: 28/06/2014, 02:20