The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point ...The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point theorem is equivalent to the generalized Ekeland variational principle.展开更多
The principle of discernibility matrix serves as a tool to discuss and analyze two algorithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specifi...The principle of discernibility matrix serves as a tool to discuss and analyze two algorithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specified by the principle of discernibility matrix; (2) ID3 can be partly, but not naturally, specified by the principle of discernibility matrix; and (3) The principle of discernibility matrix is employed to analyze Cendrowska sample set, and it shows the weaknesses of knowledge representation style of decision tree in theory.展开更多
基金Tianyuan Young Mathematics of China under Grant (10526025)Science Foundation of Nanjing Normal University under Grant(2002SXXXGQ2B20)
文摘The paper generalizes the classical Caristi＇s fixed point theorem. As an application. the classical Ekeland variational principle is generalized. In addition, it is proved that the generalized Caristi＇s fixed point theorem is equivalent to the generalized Ekeland variational principle.
基金This research is partly supported by the National '863' High-Tech Programme (No. 863-306-ZT06-07-1)and NKPSF (G1998030508).
文摘The principle of discernibility matrix serves as a tool to discuss and analyze two algorithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specified by the principle of discernibility matrix; (2) ID3 can be partly, but not naturally, specified by the principle of discernibility matrix; and (3) The principle of discernibility matrix is employed to analyze Cendrowska sample set, and it shows the weaknesses of knowledge representation style of decision tree in theory.
