Prof.  Xunwei  Zhou
Beijing Union University,  China

Title: Multiple connection operators association rule mining

Abstract:

Mutually-inversistic predicate calculi are constructed by the author. They are quantifier-free. In mutually-inversistic predicate calculi, “All men are mortal” is denoted by man(x)≤^-1mortal(x), where ≤^-1 is mutually inverse implication, a connection operator; “some even numbers are prime numbers” is denoted by even_number(x)/ꓥ^-1prime_number(x), where  /ꓥ^-1 is mutually inverse conjunction, a connection operator. A multiple connection operators association rule is in the form of, say, Student(Sno)≤^-1{course(Cno)/ꓥ^-1study(Sno, Cno)}, meaning “for all students Sno, there are courses Cno such that Sno study Cno”. The rule is naturally embraced in the relational database studying. Sno is just the primary key of the entity table student, Cno is just the primary key of the entity table course, (Sno, Cno) is just the primary key of the binary relationship table study. The mining algorithm is to mine the rules such as this.

Keywords: Mutually-inversistic predicate calculi; multiple connection operators association rule; data mining

Biography:

Xunwei Zhou received Bachelor of Engineering and postgraduate diploma in Beijing University of Technology. He is a professor emeritus in Beining Union University. He constructs mutually-inversistic logic and applies it to computer science and artificial intelligence. He published about 80 refereed papers and authored 4 monographs on them. He is a senior member of Chinese Computer Federation, a supervisor of Beijing Logical Association.