J4 ›› 2013, Vol. 48 ›› Issue (8): 97-103.

• Articles • Previous Articles     Next Articles

Inverse P-sets and intelligent fusion mining-discovery of information

GUO Hua-long, CHEN Bao-hui*, TANG Ji-hua   

  1. School of Mathematics and Computer Sciences, Longyan University, Longyan 364012, Fujian, China
  • Received:2012-10-22 Online:2013-08-20 Published:2013-08-21

Abstract:

Inverse packet sets is a new dynamic mathematical model, which is presented by introducing dynamic characteristics into Cantor set and improving Cantor set theory. Inverse packet sets is composed of internal inverse P-sets and outer inverse P-sets, and it is a set pair, i.e., (F,) a inverse packet sets, which has dynamic characteristic. In certain conditions, the inverse packet sets can be reduced into a finite general set. It has opposite dynamic characteristics to packet sets. Inverse packet reasoning is a dynamic reasoning generated by inverse packet sets. Based on inverse packet sets and inverse packet reasoning, the concepts of intelligent fusion generation of information and the intelligent fusion degree of information are put forward. The mining-discovery theorem of intelligent fusion of information and the mining-discovery criterion are given. Using those results, the application to intelligent fusion mining-discovery of information is proposed.

Key words: inverse packet sets; inverse packet reasoning; intelligent fusion of information; mining-discovery; mining-discovery theorem; mining-discovery criterion

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!