排序:将一组杂乱无章的数据按一定的规律 顺次排列起来

一、 作为抽象数据类型的数组 二、顺序表 三、 稀疏矩阵 四、 字符串

数据存储技术的重要目标就是尽可能减少读写数据所需的磁盘访问(IO操作)次数,尽可能使数据驻留在内存中。 均衡负载提高效率! 2.1.1数据的磁盘存储 2.1.2索引 2.1.3聚簇索引与非聚簇索引 2.1.4散列(HASH)簇存储

线性表抽象数据类型 顺序表 单链表 循环单链表 循环双向链表 静态链表 设计举例

作为抽象数据类型数组的类声明。 #include //在头文件“array.h”中 #include const int DefaultSize = 30;

◼ Outlier and Outlier Analysis ◼ Outlier Detection Methods ◼ Statistical Approaches ◼ Proximity-Base Approaches ◼ Clustering-Base Approaches ◼ Classification Approaches ◼ Summary

◼ Cluster Analysis: Basic Concepts ◼ Partitioning Methods ◼ Hierarchical Methods ◼ Density-Based Methods ◼ Grid-Based Methods ◼ Evaluation of Clustering ◼ Summary

◼ Classification: Basic Concepts ◼ Decision Tree Induction ◼ Bayes Classification Methods ◼ Rule-Based Classification ◼ Model Evaluation and Selection ◼ Summary

◼ Basic Concepts ◼ Frequent Itemset Mining Methods ◼ Which Patterns Are Interesting?—Pattern Evaluation Methods ◼ Summary

◼ Data Preprocessing: An Overview ◼ Data Quality ◼ Major Tasks in Data Preprocessing ◼ Data Cleaning ◼ Data Integration ◼ Data Reduction ◼ Data Transformation and Data Discretization ◼ Summary