Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Wang, Yi
Languages: English
Types: Doctoral thesis
Subjects: TA
Causality plays a central role in human reasoning, in particular, in common human decision-making, by providing a basis for strategy selection. The main aim of the research reported in this thesis is to develop a new way to identify dynamic causal relationships between attributes of a system. The first part of the thesis introduces the development of a new data mining algorithm, called Dynamic Causal Mining (DCM), which extracts rules from data sets based on simultaneous time stamps. The rules derived can be combined into policies, which can simulate the future behaviour of systems. New rules can be added to the policies depending on the degree of accuracy. In addition, facilities to process categorical or numerical attributes directly and approaches to prune the rule set efficiently are implemented in the DCM algorithm. The second part of the thesis discusses how to improve the DCM algorithm in order to identify delay and feedback relationships. Fuzzy logic is applied to manage the rules and policies flexibly and accurately during the learning process and help the algorithm to find feasible solutions. The third part of the thesis describes the application of the suggested algorithm to a problem in the game-theoretic domain. This part concludes with the suggestion to use concept lattices as a method to represent and structure the discovered knowledge.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Agrawal, R., Imielinski, T. &Swami, A. (1993) Mining Associations between Sets of Items in Massive Databases. Proceedings o f the 1993 A C M SIGMOD International Conference on Management o f Data, pp. 207-216, W ashington D.C.
    • Weill. J. C. (1994) How hard is the correct coding o f an easy endgame. In H. J. van den Herik, I. S. Herschberg, &J. W. H. M. Uiterwijk, editors, Advances in Computer Chess, Vol. 7, pp 163-176, University o f Limburg.
    • Zadeh, L.A. (1975). The Concept o f Linguistic Variable &its Application to Approximate Reasoning. Information Sciences, vol 8, pp. 199-249, 1975 (part I), vol 8, pp. 301-357, 1975 (part II), vol 9, pp. 43-80, 1976 (part III).
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article