CS 7720: Data Mining

This course studies the fundamental concepts, issues, and techniques of data mining. Topics include basics of data, data preprocessing, feature selection/extraction, frequent pattern and association/correlation mining, classification, clustering, outlier analysis, OLAP/OLAM, contrast mining, applications, etc

CS 701: Database Systems and Design I

An introduction to database design, database system implementation issues and techniques, and advanced data models and concepts

CS 3200/5200: Theoretical Foundations of Computing

CS 3200/5200 is an introduction to (a) formal language and automata theory and (b) computability. For (a), we will examine mechanisms for defining syntax of languages and devices for recognizing languages. Along with the fundamentals of these two topics, the course will investigate the relationships between language definition mechanisms and language recognition devices. For (b), we will study decision problems, the Church-Turing thesis, the undecidability of the Halting Problem, and problem reduction and undecidability. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp

CS 790-02: Advanced Data Mining

This advanced data mining course covers concepts and techniques in data mining

CS 7700: Advanced Database Systems

Introduction of design concepts, operating principles, current trends and research issues in database systems

CS 405/605-01: Introduction to Database Management Systems

Logical and physical aspects of database management systems are surveyed. Data models including entity-relationship (ER) and relational models are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are studied. Students will gain experience in creating and manipulating a database, and gain knowledge on professional and ethical responsibility and on the importance of privacy/security of data

Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Using (3+1)-ary Input Relations

Presents a first-order incremental evaluation system that uses first-order queries to maintain a database view defined by a non-first-order query. Reduction of the arity of queries to understand the power of foies; Use of a key lemma for proving a query which encodes the multiple parity problem

Masquerader Detection Using OCLEP: One-Class Classification Using Length Statistics of Emerging Patterns

We introduce a new method for masquerader detection that only uses a user’s own data for training, called Oneclass Classification using Length statistics of Emerging Patterns (OCLEP). Emerging patterns (EPs) are patterns whose support increases from one dataset/class to another with a big ratio, and have been very useful in earlier studies. OCLEP classifies a case T as self or masquerader by using the average length of EPs obtained by contrasting T against sets of samples of a user’s normal data. It is based on the observation that one needs long EPs to differentiate instances from a common class, but needs short EPs to differentiate instances from different classes. OCLEP has two novel features: for training it uses EPs mined from just the self class; for classification it uses the length statistics instead of the EPs themselves. Experiments show that OCLEP can achieve very good accuracy while keeping the false positive rate low, it achieves slightly better area-under-ROC-curve than SVM, and it can achieve good results when other approaches can not. OCLEP requires little effort in choosing parameters; the SVM requires significant tuning and it is hard to reach the theoretical optimal result. These features imply that OCLEP is a good complementary component for a robust masquerader detection system, even though its average performance in false positive rate is not as good as SVM’s