Issues in Modeling for Data Mining
|
|
- Griffin Nathaniel Fleming
- 5 years ago
- Views:
Transcription
1 Issues in Modeling for Data Mining Tsau Young (T.Y.) Lin Department of Mathematics and Computer Science San Jose State University San Jose, CA ABSTRACT Modeling in data mining has not been fully explored; so data mining is often regarded as a set of added operations in database systems. The consequence many notions are overloaded. Some terms often have different semantics. This paper continues previous effort to explore and reiterate some fundamental issues in data mining. Keywords. Modeling, data mining, equivalence relation, lattice. 1. Introduction A DBMS vender often offers a data mining service by adding a set of tools into its existing DBMS. This practice has been translates into, in academic world, the following view:data mining is a set of added operations onto the classical data model. So database terms are used without changes in data mining research. This is a confusing, in fact, an incorrect view. Some semantics of these terms can be very different between database and data mining. Roughly database stores data according to its semantics. While data mining is to discover what the data have expressed. A set of data may not be able to fully expressed the given semantics What is data mining? A commonly quoted definition defines data mining as a non-trivial process of identifying valid, novel, potentially useful, and ultimately understandable patterns from data [3]. We have pointed out in several occasions that some terms, such as novel, useful, and understandable are subjective and can not be used as scientific criteria. However, they do point out one important requirement: The discovered patterns should be relevant to the real world. We call it a real-world-pattern. We believe Real-world-patterns are the primary goal of data mining This leads us to examine the mathematical modeling of realworldforthepurposeofdatamining Notations Let U be the set of the real world entities and A ={A 1,A 2,, A n } be a set of attributes. A relation K will be viewed as a knowledge representation that assigns each entity or object a unique tuple, K: U Dom(A 1 ) Dom(A 2 )... Dom(A n ); u (a 1,a 2,,a n ), where Dom(-) is the active domain (= the set of attribute values currently in use). Traditionally, the image of K is referred to as a relation. For modeling, it is more convenient to have the independent variables available for discussions, so we will use the graph (u, K(u)) and call it information table or simply table. 2. Are the Given Attributes Adequate? A tuple (of degree n) in a numerical relation (of degree n) can be regarded as a coordinate of a point in n dimensional Euclidean space. A coordinate system {X 1, X 2,,X n } of an Euclidean space is a set {A 1,A 2,,A n } of attribute names. A point p x with coordinate x = (x 1,x 2,, x n ) is a tuple. The set P = {p x }of points is a coordinate dependent concept; it is a set of points, real world objects. While the set R of numerical tuples is a coordinate dependent concept; it is merely a merely representation, a matrix. A pattern (a statement about property of R) may or may not be a real world event (a statement about geometry). A pattern with real world significance is, then, a geometric property of P Invisible Association Rules? Letusre-visittheexample[p]:Thefirstcolumnisthelist of entities(directed segments). Attribute B is the Starting point of a direct segment, the others are the Degree and
2 Length ( polar coordinates ). This table only has one association rule of length 2, namely, (p 3, 2.0) if the required support is 4. Segment# S D L S 1 p S 2 p S 3 p S 4 p S 5 p S 6 p S 7 p S 8 p S 9 p S 10 p Table directed segments in polar coordinates Segment# B H V S 1 p S 2 p S 3 p S 4 p S 5 p S 6 p S 7 p S 8 p S 9 p S 10 p Table directed segments in (X,Y)-coordinates Table 2 is transformed from Table 1 by switching to Cartesian coordinate system; the two new attributes are Horizontal and Vertical length. The only association rule disappears. In this geometric database, the association rule is a real world phenomenon (a geometric fact), the same information should be still carried by Table 2. The question is then: How can such invisible association rules be discovered from Table 2? 3. Mining on Derived Attributes? To understand what is really reflected by attributes, let us examine a simple example. Table 3 is a numerical information table of 9 points in the Euclidean 3-space. The first column is the names of the points, the second columns and etc are Z-X- and Y- coordinates point X Y Z P P P P P P P P P Table 3. 9 points with coordinate in Euclidean 3-space Next, let us consider a transformation that rotates the X- and Y- axes around Z-axis. Table 4 expands Table 3 by including new X- and Y- coordinates of various rotations. The suffixes, 20, 30, 52, and 79, represent the new coordinate axes (attribute names) that rotate 0.20, 0.30 and etc radians. Each new axis is a new derived attribute. point Z X Y X20 Y20 X30 Y30 X52 Y52 X79 Y79 P P P P P P P P P Table 4. 9 points with coordinate in various axes; they rotate radians, 0.2, 0.3, 0.53(=30 o ), 0.79(=45 o )
3 The table seems indicate that there are at least as many new attributes as angles. Even worse, there are many non-linear transformations not listed in Table 4. Several questions arise: 1. Are all these attributes distinct? (from data mining point of view) 2. Could we find ALL derived attributes? 3. Should data mining consider all of them? We will answer the first and second one in next few sections. For third question, from scientific point of view, we should consider all, however, from practical application point of view, we may only want to select some from all. This indicates that we should extend the common practices of feature selection to this full set, not on the given set of attiutes. 3. Is Labeling Concepts/Data Necessary? 3.1. Isomorphic Attributes and Tables Definition 1. Attributes A i and A j are isomorphic iff there is a one-to-one and onto map, s: Dom(A i ) Dom(A j ) such that A j (v)= s(a i (v)), v V.siscalled an isomorphism [p]. Definition 2. Let K and H be two information tables with thesameuniversev.leta={a 1,A 2,,A n }andb ={B 1, B 2,, B m } be the attributes of K and H respectively. Then, K and H are said to be isomorphic if every A i is isomorphic to some B j, and vice versa. If n = m, then it is said to be strict isomorphic. Intuitively isomorphic is re-labeling. theorem should be obvious. The following Theorem 1. Let K and H be strictly isomorphic. Then patterns, such as, association rules, of K can be transformed to those of H by re-labeling the data. Corollary Labeling the attribute values (base concepts) does not influence the results of data mining. Now, we apply the notion of isomorphism to Table 4, we find that X X20 X30 X52 X79 Y20 Y30; where means isomorphic. So by dropping the isomorphic attributes, Table 4 is reduced to Table 5. point Z X Y Y52 Y79 P P P P P P P P P Table 5 Simplified Table of 9 points The association rules are (support 3) (Z=1,Y52=0); (Z =2,Y79=0); 3.2. Isomorphic High Level Concepts One of the important data mining practices is the concept hierarchy (attribute oriented generalization). In the current state of arts, human users supply the concept hierarchies [4]. In other words, the nested sequence of equivalence relations are labeled by human users. The question is: Is such a labeling necessary for data mining? In other words, will we get new rules if we rename all the nodes of a hierarchy? By considering the table of high level concepts and results of Section 3.1, the answer is no (re-labeling Table 6 will not change the high level association rules) Theorem2. Isomorphic AOG have isomorphic high level association rules. Corollary Given a nested sequence of partitions, the generalized (high level) association rules are independent of labeling. Corollary Labeling the high level and base concepts does not influence the results of data mining. point Z X Y
4 P1 P2 P3 P4 P5 P6 P7 P8 Lz45={2} Lz45={2} Lz45={2} Lx00= {200, 100} Ly00={0} Lx00= {200, 100} Ly00={0} Lx30= Ly30= {173, 87, 44} {100, 50,25} Lx30= Ly30= {173, 87, 44} {100, 50,25} Lx30= Ly30= {173, 87, 44} {100, 50,25} Lx45= Ly45= {141, 71, 36} {141, 71,36} Lx45= Ly45= {141, 71, 36} {141, 71,36} Lx45= Ly45= {141, 71, 36} {141, 71,36} P Table Granular Data Model High Level Table; granules are labeled In last section, we have shown that labels are not essential. So for data mining the underlying mathematical structures is important and we will use them to label the data [7,8, 9, 10]. An attribute can be interpreted as the composition of K and the projection P j :Dom(A 1 ) Dom(A 2 )... Dom(A n ) Dom(A j ) A j :U Dom(A j ). Each A j induces a partition on U. By replacing attribute values a j with its inverse image (A j ) (-1) (a i ); the collection of these inverse images together forms a partition on U. For example, Pi= {p i }, P12={p 1,p 2 }and,p345={p 3, p 4,p 5 }, P678=={p 6,p 7,p 8 } are equivalence classes. One can label an equivalence class by itself (called canonical names ). So Pi, Pij, Pijk are labels (canonical names) of the respective equivalence classes. Using these canonical names, Table 4 is transformed to Table 9; such a table is called a unnamed relation, because each granule is not assigned a human oriented meaningful name; they also have been called machine oriented model [10]. Each attribute value of Table 4 is a human oriented meaningful name of the corresponding Pi in Table 9. This naming is an isomorphism, that is, Table 4 is isomorphic to Table 9. Note that the attribute names, say A, are replaced by the induced equivalence relation E A. We hope, we have convinced the readers the following theorem: Theorem 3. Unnamed information table (relation) is isomorphic to the original table K, hence their respective association rules are isomorphic. The essential ingredients in an unnamed relations are U and E, where E ={E 1, E 2,, E n } is the set of equivalence relations induced by attributes. We will call the pair (U, E={E 1,E 2,,E n }) a Granular Data Model (GDM) of K. Pawlak called (U, E) an approximation space, if E has only one equivalence relation, and in general a knowledge base; knowledge base often has different meaning, we will use Granular Data Model. Summarize the discussions above we have: Definition. Given an (ordinary) relation K, then the information table (relation), obtained by using the induced equivalence relations as the names of attributes and equivalence classes as attribute values, is called an unnamed table (relation) of K; the Pair (U, E) is called the granular data model of K. point E Z E X E Y E X20 E Y20 E X30 E Y30 E X52 E Y52 E X79 E Y79 P1 P12 P1 P12 P1 P1 P1 P1 P1 P1 P1 P1 P2 P12 P2 P12 P2 P2 P2 P2 P2 P2 P2 P2 P3 P345 P3 P3 P3 P3 P3 P3 P3 P345 P3 P3 P4 P345 P4 P4 P4 P4 P4 P4 P4 P345 P4 P4 P5 P345 P5 P5 P5 P5 P5 P5 P5 P345 P5 P5 P6 P678 P6 P6 P6 P6 P6 P6 P6 P6 P6 P678 P7 P678 P7 P7 P7 P7 P7 P7 P7 P7 P7 P678 P8 P678 P8 P8 P8 P8 P8 P8 P8 P8 P8 P678 P9 P9 P9 P9 P9 P9 P9 P9 P9 P9 P9 P9 Table 9. Unnamed Relation (attribute values are expressed by granules)
5 The uses of unnamed relations have some advantage over the traditional ones in machine processing (including data mining). For example, we have shown in Table 4 that many attributes are isomorphic (with efforts); while in Table 9 isomorphic attributes are the identical columns. So the simplification of Table 9 into Table 10 becomes effortless in unnamed relations. point Z X Y Y52 Y79 P1 P12 P1 P12 P1 P1 P2 P12 P2 P12 P2 P2 P3 P345 P3 P3 P345 P3 P4 P345 P4 P4 P345 P4 P5 P345 P5 P5 P345 P5 P6 P678 P6 P6 P6 P678 P7 P678 P7 P7 P7 P678 P8 P678 P8 P8 P8 P678 P9 P9 P9 P9 P9 P9 Table 10. Simplified Unnamed Relation 5. The Features Completion- the Lattice in Partition In this section, we will show how one can use granular data model/unnamed relation to find all derived attributes Attribute Transformations By a new attribute Y we mean there is a subset, denoted by Dom(Y), and an onto map U Dom(Y). Let B={B 1, B 2,,B k } be a subset of of A, that is, each B i is some A ji. Letusassumethereisamap f: Dom(B 1 ) Dom(B 2 )... Dom(B k ) Dom(Y). such that f(b 1 (u), B 2 (u),, B k (u))=y(u) u. Then we said Y is an attribute transformed from B = {B 1,B 2,, B k }, and denoted by Y= f(b 1,B 2,,B k ) The details of f are illustrated in Table 7. V (B 1 B 2 B k Y) v 1 (b 1 1 b b k 1 f 1 =f(b 1 1,b 2 1,...,b k 1)) v 2 (b 1 2 b b k 2 f 2 =f(b 1 2,b 2 2,...,b k 2)) v 3 (b 1 3 b b k 3 f 3 =f(b 1 3,b 2 3,...,b k 3)) v i (b 1 i b 2 i b k i f i =f(b 1 i,b 2 i,...,b k i)) Table 7 Attribute (feature) Transformations In database theory, we say Y is (extension) functionally depended on B. The equivalence relation induced by Y is denoted by Y E. Theorem 4. Y is an attribute transformed from B ={B 1,B 2,, B k }iffy E is a coarsening of E B1 E B2... E Bk,where each E Bi is the equivalence relation induced by B i Lattices of Partitions induced by Attributes Let E be the set of equivalence relation induced by the attributes of K; see the beginning of Section 4. The Boolean algebra 2 E is a lattice. Let Π (U) be the lattice of all partitions (equivalence relations) on U; its join is the intersection of equivalence relations and the meet is the union of equivalence relations, where the union is the smallest coarsening of its components. T. T. Lee uses the map θ: 2 A Π(U), to summarize the fact that each attribute induces an equivalence relation on the universe U. He observed that the map only respects the meet, but not the join [5]. The image of θ was called the relation lattice; he observed then that the image is a subset of Π(U), but not a sublattice. This is the point of our departure. Previously, we have let L(E) be the smallest sublattice that contains E and called it the generalized relation lattice [8, 9]. We also have called the smallest sublattice that contains E and all its coarsening the lattice-in-partitions and denoted by L(E*) [6]. Theorem 5. L(E*) is a finite lattice and the feature completion of E. This theorem says that the number of derived attributes is finite. For data mining, we may consider the following granular data model (GDM) for a given K. 1. (U, E) is the GDM of K 2. (U, L(E)) is a new GDM associated with K 3. (U, L(E*)) is a new GDM that contains feature completion 4. (U, G) is a new GDM that contains essential attributes, where G consists only of all join-irreducible equivalence relations in L(E*). All possible generalized association canbe found here.
6 Let us consider a Table that collapses redundant tuples in Table 6 point Z X Y P12=u 1 Lz03 Lx00 Ly00 P345= u 2 Lz03 Lx30 Ly30 P678= u 3 Lz45 Lx45 Ly45 P9= u Table 11. An Information Table K (Reduced Table 6) It is clear X Y, so we drop Y and have an unnamed relation. point E Z E X P12=u 1 {u 1,u 2 } {u 1 } P345= u 2 {u 1,u 2 } {u 2 } P678= u 3 {u 3 } {u 3 } P9= u 4 {u 4 } {u 4 } Table 12. Unnamed relation of K Since E Z E X has 4 equivalence classes, so the number of all possible derived attribute is the Bell number B 4 =16; see [2]. We will not display them. References [1] G. Birkhoff and S. MacLane, A Survey of Modern Algebra, Macmillan, 1977 [2] R. Brualdi, Introductory Combinatorics, Prentice Hall, [3] Fayad, U. M., Piatetsky-Sjapiro, G. Smyth, P. From Data Mining to Knowledge Discovery: An overview. In Fayard, Piatetsky-Sjapiro, Smyth, and Uthurusamy eds., Knowledge Discovery in Databases, AAAI/MIT Press, [4]. Hadjimichael, H. Hamilton, N. Cercone. ``Extracting Concept Hierarchies from Relational Databases,'' in Proceedings, FLAIRS-95, Florida AI Research Symposium, Melbourne Beach, Florida, [5] T. T. Lee, Algebraic Theory of Relational Databases, The Bell System Technical Journal Vol 62, No 10, December, 1983, pp [6] T.Y. Lin, Data Modeling for Data Mining. In: Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, B. Dasarathy (ed), Proceeding of SPIE Vol 4730, Orlando, Fl, April 1-5, 2002 [7] T. Y. Lin, "Data Mining: Granular Computing Approach." In: Methodologies for Knowledge Discovery and Data Mining, Lecture Notes in Artificial Intelligence 1574, Third Pacific-Asia Conference, Beijing, April 26-28, 1999, [8] T.Y. Lin, Feature Transformations and Structure of Attributes In: Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, Proceeding of SPIE s aerosence April 2002 Orlando, FL. [9] T.Y. Lin, The Lattice Structure of Database and Mining High Level Rules. In: Proceedings of Workshop on Data Mining and E-Organizations, International Conference on Computer Software and Applications, Chicago, 2001, October 8-12, Also in Bulletin of International Rough Set Society [10] T. Y. Lin, ``Data Mining and Machine Oriented Modeling: A Granular Computing Approach," Journal of Applied Intelligence, Kluwer, Vol. 13, No 2, September/October,2000, pp
A Logical Formulation of the Granular Data Model
2008 IEEE International Conference on Data Mining Workshops A Logical Formulation of the Granular Data Model Tuan-Fang Fan Department of Computer Science and Information Engineering National Penghu University
More informationSets with Partial Memberships A Rough Set View of Fuzzy Sets
Sets with Partial Memberships A Rough Set View of Fuzzy Sets T. Y. Lin Department of Mathematics and Computer Science San Jose State University San Jose, California 95192-0103 E-mail: tylin@cs.sjsu.edu
More informationConcept Lattices in Rough Set Theory
Concept Lattices in Rough Set Theory Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca URL: http://www.cs.uregina/ yyao Abstract
More informationNeighborhoods Systems: Measure, Probability and Belief Functions
202-207. Neighborhoods Systems: Measure, Probability and Belief Functions T. Y. Lin 1 * tylin@cs.sjsu.edu Y, Y, Yao 2 yyao@flash.lakeheadu.ca 1 Berkeley Initiative in Soft Computing, Department of Electrical
More informationClassification Based on Logical Concept Analysis
Classification Based on Logical Concept Analysis Yan Zhao and Yiyu Yao Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada S4S 0A2 E-mail: {yanzhao, yyao}@cs.uregina.ca Abstract.
More informationHigh Frequency Rough Set Model based on Database Systems
High Frequency Rough Set Model based on Database Systems Kartik Vaithyanathan kvaithya@gmail.com T.Y.Lin Department of Computer Science San Jose State University San Jose, CA 94403, USA tylin@cs.sjsu.edu
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationFUZZY PARTITIONS II: BELIEF FUNCTIONS A Probabilistic View T. Y. Lin
FUZZY PARTITIONS II: BELIEF FUNCTIONS A Probabilistic View T. Y. Lin Department of Mathematics and Computer Science, San Jose State University, San Jose, California 95192, USA tylin@cs.sjsu.edu 1 Introduction
More informationFoundations of Classification
Foundations of Classification J. T. Yao Y. Y. Yao and Y. Zhao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 {jtyao, yyao, yanzhao}@cs.uregina.ca Summary. Classification
More informationPositional Analysis in Fuzzy Social Networks
2007 IEEE International Conference on Granular Computing Positional Analysis in Fuzzy Social Networks Tuan-Fang Fan Institute of Information Management National Chiao-Tung University Hsinchu 300, Taiwan
More informationModel Complexity of Pseudo-independent Models
Model Complexity of Pseudo-independent Models Jae-Hyuck Lee and Yang Xiang Department of Computing and Information Science University of Guelph, Guelph, Canada {jaehyuck, yxiang}@cis.uoguelph,ca Abstract
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationTowards a Denotational Semantics for Discrete-Event Systems
Towards a Denotational Semantics for Discrete-Event Systems Eleftherios Matsikoudis University of California at Berkeley Berkeley, CA, 94720, USA ematsi@eecs. berkeley.edu Abstract This work focuses on
More informationA Generalized Decision Logic in Interval-set-valued Information Tables
A Generalized Decision Logic in Interval-set-valued Information Tables Y.Y. Yao 1 and Qing Liu 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca
More information2. Intersection Multiplicities
2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.
More informationTUNING ROUGH CONTROLLERS BY GENETIC ALGORITHMS
TUNING ROUGH CONTROLLERS BY GENETIC ALGORITHMS Teresa Chiu Department of Mathematics and Computer Science Sun Jose State University San Jose, California 95192 T.Y. Lin* Department of Electrical and Computer
More informationRelational Algebra Part 1. Definitions.
.. Cal Poly pring 2016 CPE/CC 365 Introduction to Database ystems Alexander Dekhtyar Eriq Augustine.. elational Algebra Notation, T,,... relations. t, t 1, t 2,... tuples of relations. t (n tuple with
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationNeural Networks, Qualitative-Fuzzy Logic and Granular Adaptive Systems
Neural Networs, Qualitative-Fuzzy Logic and Granular Adaptive Systems T. Y. Lin Department of Mathematics and Computer Science San Jose State University, San Jose, CA 95192 tylin@cs.ssu.edu Abstract-Though
More informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationA new Approach to Drawing Conclusions from Data A Rough Set Perspective
Motto: Let the data speak for themselves R.A. Fisher A new Approach to Drawing Conclusions from Data A Rough et Perspective Zdzisław Pawlak Institute for Theoretical and Applied Informatics Polish Academy
More informationOn the Structure of Rough Approximations
On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study
More informationQUIVERS AND LATTICES.
QUIVERS AND LATTICES. KEVIN MCGERTY We will discuss two classification results in quite different areas which turn out to have the same answer. This note is an slightly expanded version of the talk given
More informationRigid Geometric Transformations
Rigid Geometric Transformations Carlo Tomasi This note is a quick refresher of the geometry of rigid transformations in three-dimensional space, expressed in Cartesian coordinates. 1 Cartesian Coordinates
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationNotes on the Dual Ramsey Theorem
Notes on the Dual Ramsey Theorem Reed Solomon July 29, 2010 1 Partitions and infinite variable words The goal of these notes is to give a proof of the Dual Ramsey Theorem. This theorem was first proved
More informationThe matrix approach for abstract argumentation frameworks
The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced
More informationInquiry Calculus and the Issue of Negative Higher Order Informations
Article Inquiry Calculus and the Issue of Negative Higher Order Informations H. R. Noel van Erp, *, Ronald O. Linger and Pieter H. A. J. M. van Gelder,2 ID Safety and Security Science Group, TU Delft,
More informationVectors and Matrices
Vectors and Matrices Scalars We often employ a single number to represent quantities that we use in our daily lives such as weight, height etc. The magnitude of this number depends on our age and whether
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 12 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices
More informationA Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space
From: FLAIRS- Proceedings. Copyright AAAI (www.aaai.org). All rights reserved. A Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space Debasis Mitra Department of Computer
More informationLecture 1: Lattice(I)
Discrete Mathematics (II) Spring 207 Lecture : Lattice(I) Lecturer: Yi Li Lattice is a special algebra structure. It is also a part of theoretic foundation of model theory, which formalizes the semantics
More information1 Linear transformations; the basics
Linear Algebra Fall 2013 Linear Transformations 1 Linear transformations; the basics Definition 1 Let V, W be vector spaces over the same field F. A linear transformation (also known as linear map, or
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMathematics Review for Business PhD Students
Mathematics Review for Business PhD Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More information3. FORCING NOTION AND GENERIC FILTERS
3. FORCING NOTION AND GENERIC FILTERS January 19, 2010 BOHUSLAV BALCAR, balcar@math.cas.cz 1 TOMÁŠ PAZÁK, pazak@math.cas.cz 1 JONATHAN VERNER, jonathan.verner@matfyz.cz 2 We now come to the important definition.
More informationRough Set Approaches for Discovery of Rules and Attribute Dependencies
Rough Set Approaches for Discovery of Rules and Attribute Dependencies Wojciech Ziarko Department of Computer Science University of Regina Regina, SK, S4S 0A2 Canada Abstract The article presents an elementary
More informationData Mining and Analysis
978--5-766- - Data Mining and Analysis: Fundamental Concepts and Algorithms CHAPTER Data Mining and Analysis Data mining is the process of discovering insightful, interesting, and novel patterns, as well
More informationInterpreting Low and High Order Rules: A Granular Computing Approach
Interpreting Low and High Order Rules: A Granular Computing Approach Yiyu Yao, Bing Zhou and Yaohua Chen Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail:
More informationFUZZY ASSOCIATION RULES: A TWO-SIDED APPROACH
FUZZY ASSOCIATION RULES: A TWO-SIDED APPROACH M. De Cock C. Cornelis E. E. Kerre Dept. of Applied Mathematics and Computer Science Ghent University, Krijgslaan 281 (S9), B-9000 Gent, Belgium phone: +32
More informationRough operations on Boolean algebras
Rough operations on Boolean algebras Guilin Qi and Weiru Liu School of Computer Science, Queen s University Belfast Belfast, BT7 1NN, UK Abstract In this paper, we introduce two pairs of rough operations
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationModel theory, stability, applications
Model theory, stability, applications Anand Pillay University of Leeds June 6, 2013 Logic I Modern mathematical logic developed at the end of the 19th and beginning of 20th centuries with the so-called
More informationVectors Coordinate frames 2D implicit curves 2D parametric curves. Graphics 2008/2009, period 1. Lecture 2: vectors, curves, and surfaces
Graphics 2008/2009, period 1 Lecture 2 Vectors, curves, and surfaces Computer graphics example: Pixar (source: http://www.pixar.com) Computer graphics example: Pixar (source: http://www.pixar.com) Computer
More informationRigid Geometric Transformations
Rigid Geometric Transformations Carlo Tomasi This note is a quick refresher of the geometry of rigid transformations in three-dimensional space, expressed in Cartesian coordinates. 1 Cartesian Coordinates
More informationA Comparative Study of Noncontextual and Contextual Dependencies
A Comparative Study of Noncontextual Contextual Dependencies S.K.M. Wong 1 C.J. Butz 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: wong@cs.uregina.ca
More informationLinear Vector Spaces
CHAPTER 1 Linear Vector Spaces Definition 1.0.1. A linear vector space over a field F is a triple (V, +, ), where V is a set, + : V V V and : F V V are maps with the properties : (i) ( x, y V ), x + y
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationZaslavsky s Theorem. As presented by Eric Samansky May 11, 2002
Zaslavsky s Theorem As presented by Eric Samansky May, 2002 Abstract This paper is a retelling of the proof of Zaslavsky s Theorem. For any arrangement of hyperplanes, there is a corresponding semi-lattice
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date May 9, 29 2 Contents 1 Motivation for the course 5 2 Euclidean n dimensional Space 7 2.1 Definition of n Dimensional Euclidean Space...........
More informationLexington High School Mathematics Department Honors Pre-Calculus Final Exam 2002
Name Teacher (circle): Roos/Andersen Kelly Kresser Class block (circle): A B C D E F G H Lexington High School Mathematics Department Honors Pre-Calculus Final Exam 00 This is a 90-minute exam, but you
More informationDiscovery of Functional and Approximate Functional Dependencies in Relational Databases
JOURNAL OF APPLIED MATHEMATICS AND DECISION SCIENCES, 7(1), 49 59 Copyright c 2003, Lawrence Erlbaum Associates, Inc. Discovery of Functional and Approximate Functional Dependencies in Relational Databases
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationHierarchical Structures on Multigranulation Spaces
Yang XB, Qian YH, Yang JY. Hierarchical structures on multigranulation spaces. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(6): 1169 1183 Nov. 2012. DOI 10.1007/s11390-012-1294-0 Hierarchical Structures
More informationThe size of decision table can be understood in terms of both cardinality of A, denoted by card (A), and the number of equivalence classes of IND (A),
Attribute Set Decomposition of Decision Tables Dominik Slezak Warsaw University Banacha 2, 02-097 Warsaw Phone: +48 (22) 658-34-49 Fax: +48 (22) 658-34-48 Email: slezak@alfa.mimuw.edu.pl ABSTRACT: Approach
More informationModeling the Real World for Data Mining: Granular Computing Approach
Modeling the Real World for Data Mining: Granular Computing Approach T. Y. Lin Department of Mathematics and Computer Science San Jose State University, San Jose, California 95192-0103 and Berkeley Initiative
More informationInterval based Uncertain Reasoning using Fuzzy and Rough Sets
Interval based Uncertain Reasoning using Fuzzy and Rough Sets Y.Y. Yao Jian Wang Department of Computer Science Lakehead University Thunder Bay, Ontario Canada P7B 5E1 Abstract This paper examines two
More informationA Family of Finite De Morgan Algebras
A Family of Finite De Morgan Algebras Carol L Walker Department of Mathematical Sciences New Mexico State University Las Cruces, NM 88003, USA Email: hardy@nmsuedu Elbert A Walker Department of Mathematical
More informationEasy Categorization of Attributes in Decision Tables Based on Basic Binary Discernibility Matrix
Easy Categorization of Attributes in Decision Tables Based on Basic Binary Discernibility Matrix Manuel S. Lazo-Cortés 1, José Francisco Martínez-Trinidad 1, Jesús Ariel Carrasco-Ochoa 1, and Guillermo
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationOn flexible database querying via extensions to fuzzy sets
On flexible database querying via extensions to fuzzy sets Guy de Tré, Rita de Caluwe Computer Science Laboratory Ghent University Sint-Pietersnieuwstraat 41, B-9000 Ghent, Belgium {guy.detre,rita.decaluwe}@ugent.be
More informationLinear Algebra II. 7 Inner product spaces. Notes 7 16th December Inner products and orthonormal bases
MTH6140 Linear Algebra II Notes 7 16th December 2010 7 Inner product spaces Ordinary Euclidean space is a 3-dimensional vector space over R, but it is more than that: the extra geometric structure (lengths,
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationOn the connection of Hypergraph Theory with Formal Concept Analysis and Rough Set Theory 1
On the connection of Hypergraph Theory with Formal Concept Analysis and Rough Set Theory 1 Gianpiero Cattaneo and Giampiero Chiaselotti o and Davide Ciucci and Tommaso Gentile o Department of Informatics,
More informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More informationPhysical justification for using the tensor product to describe two quantum systems as one joint system
Physical justification for using the tensor product to describe two quantum systems as one joint system Diederik Aerts and Ingrid Daubechies Theoretical Physics Brussels Free University Pleinlaan 2, 1050
More informationWhat You Must Remember When Processing Data Words
What You Must Remember When Processing Data Words Michael Benedikt, Clemens Ley, and Gabriele Puppis Oxford University Computing Laboratory, Park Rd, Oxford OX13QD UK Abstract. We provide a Myhill-Nerode-like
More informationOn Machine Dependency in Shop Scheduling
On Machine Dependency in Shop Scheduling Evgeny Shchepin Nodari Vakhania Abstract One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at
More informationTHE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS
THE REPRESENTATION THEORY, GEOMETRY, AND COMBINATORICS OF BRANCHED COVERS BRIAN OSSERMAN Abstract. The study of branched covers of the Riemann sphere has connections to many fields. We recall the classical
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationLattice Theory Lecture 4. Non-distributive lattices
Lattice Theory Lecture 4 Non-distributive lattices John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Introduction Here we mostly consider
More information9. Birational Maps and Blowing Up
72 Andreas Gathmann 9. Birational Maps and Blowing Up In the course of this class we have already seen many examples of varieties that are almost the same in the sense that they contain isomorphic dense
More informationarxiv: v1 [cs.lo] 19 Mar 2019
Turing-Completeness of Dynamics in Abstract Persuasion Argumentation Ryuta Arisaka arxiv:1903.07837v1 [cs.lo] 19 Mar 2019 ryutaarisaka@gmail.com Abstract. Abstract Persuasion Argumentation (APA) is a dynamic
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationA Generalized Framework for Reasoning with Angular Directions
A Generalized Framework for Reasoning with Angular Directions Debasis Mitra Department of Computer Sciences Florida Institute of Technology Melbourne, FL 3901, USA Tel. 31-674-7737, Fax: -7046, E-mail:
More informationGeometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
More informationLecture 1: Basic Concepts
ENGG 5781: Matrix Analysis and Computations Lecture 1: Basic Concepts 2018-19 First Term Instructor: Wing-Kin Ma This note is not a supplementary material for the main slides. I will write notes such as
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationEvery Linear Order Isomorphic to Its Cube is Isomorphic to Its Square
Every Linear Order Isomorphic to Its Cube is Isomorphic to Its Square Garrett Ervin University of California, Irvine May 21, 2016 We do not know so far any type α such that α = α 3 = α 2. W. Sierpiński,
More informationOntologies and Domain Theories
Ontologies and Domain Theories Michael Grüninger Department of Mechanical and Industrial Engineering University of Toronto gruninger@mie.utoronto.ca Abstract Although there is consensus that a formal ontology
More information1. Ignoring case, extract all unique words from the entire set of documents.
CS 378 Introduction to Data Mining Spring 29 Lecture 2 Lecturer: Inderjit Dhillon Date: Jan. 27th, 29 Keywords: Vector space model, Latent Semantic Indexing(LSI), SVD 1 Vector Space Model The basic idea
More informationA BRIEF INTRODUCTION TO MATHEMATICAL RELATIVITY PART 1: SPECIAL RELATIVITY ARICK SHAO
A BRIEF INTRODUCTION TO MATHEMATICAL RELATIVITY PART 1: SPECIAL RELATIVITY ARICK SHAO These notes are the first of a pair of brief articles containing an informal introduction to the mathematics behind
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 11
18.312: Algebraic Combinatorics Lionel Levine Lecture date: March 15, 2011 Lecture 11 Notes by: Ben Bond Today: Mobius Algebras, µ( n ). Test: The average was 17. If you got < 15, you have the option to
More informationFuzzy Limits of Functions
Fuzzy Limits of Functions Mark Burgin Department of Mathematics University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA 90095 Abstract The goal of this work is to introduce and study fuzzy
More information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationAN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION
AN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION Daniel Halpern-Leistner 6/20/08 Abstract. I propose an algebraic framework in which to study measures of information. One immediate consequence
More informationCHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION. From Exploratory Factor Analysis Ledyard R Tucker and Robert C. MacCallum
CHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION From Exploratory Factor Analysis Ledyard R Tucker and Robert C. MacCallum 1997 19 CHAPTER 3 THE COMMON FACTOR MODEL IN THE POPULATION 3.0. Introduction
More informationMulti-coloring and Mycielski s construction
Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationCategory theory and set theory: algebraic set theory as an example of their interaction
Category theory and set theory: algebraic set theory as an example of their interaction Brice Halimi May 30, 2014 My talk will be devoted to an example of positive interaction between (ZFC-style) set theory
More informationFeature Selection with Fuzzy Decision Reducts
Feature Selection with Fuzzy Decision Reducts Chris Cornelis 1, Germán Hurtado Martín 1,2, Richard Jensen 3, and Dominik Ślȩzak4 1 Dept. of Mathematics and Computer Science, Ghent University, Gent, Belgium
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More information