There are two main contributions in the thesis . Firstly, we design a novel and efficient algorithm for mining calendar-based association rules which have multilevel time granularities in temporal databases. Unlike apriori-like approaches , our method scans the database twice at most. By avoiding multiple scans over the database , our method can reduce the database scanning time. Secondly, we use membership functions to construct fuzzy calendar patterns which represent asynchronous periods. With the use of fuzzy calendar patterns, we can discover fuzzy periodical association rules which are association rules occurring in asynchronous periods. Experimental results have shown that our method is more efficient than others, and we can find fuzzy periodical association rules satisfactorily.

Dans le cadre de cette thèse, notre intérêt se porte sur la précision de la classification et l'optimalité du parcours de l'espace de recherche. L'objectif recherché est d'améliorer la précision de classification en étudiant les différents types de règles et de réduire l'espace de recherche des règles. Nous avons proposé une approche de classification IGARC permettant de générer un classifieur formé d'une base de règles de classification génériques permettant de mieux classer les nouveaux objets grâce à la flexibilité de petites prémisses caractérisant ces règles. De plus cette approche manipule un nombre réduit de règles en comparaison avec les autres approches de classification associative en se basant sur le principe des bases génériques des règles associatives. Une étude expérimentale inter et intra approches a été faite sur 12 bases Benchmark.Nous avons également proposé une approche Afortiori. Notre travail a été motivé par la recherche d'un algorithme efficace permettant l'extraction des règles génériques aussi bien fréquentes que rares de classification en évitant la génération d'un grand nombre de règles. L'algorithme que nous proposons est particulièrement intéressant dans le cas de bases de données bien spécifiques composées d'exemples positifs et négatifs et dont le nombre d'exemples négatifs est très réduit par rapport aux exemples positifs. La recherche des règles se fait donc sur les exemples négatifs afin de déterminer des règles qui ont un faible support et ce même par rapport à la population des exemples positifs et dont l'extraction pourrait être coûteuse. / Within the framework of this thesis, our interest is focused on classification accuracy and the optimalité of the traversal of the search. we introduced a new direct associative classification method called IGARC that extracts directly a classifier formed by generic associative classification rules from a training set in order to reduce the number of associative classification rules without jeopardizing the classification accuracy. Carried out experiments outlined that IGARC is highly competitive in comparison with popular classification methods.We also introduced a new classification approach called AFORTIORI. We address the problem of generating relevant frequent and rare classification rules. Our work is motivated by the long-standing open question of devising an efficient algorithm for finding rules with low support. A particularly relevant field for rare item sets and rare associative classification rules is medical diagnosis. The proposed approach is based on the cover set classical algorithm. It allows obtaining frequent and rare rules while exploring the search space in a depth first manner. To this end, AFORTIORI adopts the covering set algorithm and uses the cover measure in order to guide the traversal of the search space and to generate the most interesting rules for the classification framework even rare ones. We describe our method and provide comparisons with common methods of associative classification on standard benchmark data set.

The aim of this thesis is to evaluate chosen business rules management systems. In addition, it should provide global overview of all business rules area. Crucial definitions and principles related to the Business Rules Management are introduced in the first part of the thesis. The different types ofbusiness rules description, therelation between business rules and business processes, and technology used for BRMS are specified among others. In the second section,the evaluation criteria are created based the previous theoretical analysis. The criteria are divided into groups based on a functionality that should be provided by a business rules management system. The evaluation and its results are presented in the last part of the thesis. The results are discussed and the final conclusion is provided.The thesis can be used as baseline in the decision making process when a business rules management system is to be purchased.

No description available.

No description available.

No description available.

No description available.

本文強烈地支持技術分析在台灣股票市場的有效性。本研究使用簡單技術分析法則－移動平均線法和區間突破法則，此兩法則在Brock el al(1992) 的文獻中被證明在道瓊工業指數具有獲利性。本文引用此兩法則於1981-2008的台灣股票加權指數。根據實證結果顯示，由此兩法則所產生的報酬率和利用拔靴法模擬出來的序列資料產生的報酬率結果並不一致。除此之外，即使考慮了交易成本，這些簡單技術交易法則仍然能在不同的類股指數中獲利。 / The results in this paper strongly support the practicability of technical rules in Taiwan. Two of simplest rules－moving average and trading range break which were proved to be useful in Brock el al(1992) also possess predictive power in Taiwan stock index from 1981 to 2008. The return generated from these technical rules are not consistent with four null model, random walk, AR(1), the AR-GARCH and AR-GARCH-M. Besides, the returns from these technical rules can remain positive after cutting transaction costs. These technical rules can also apply to sector index and still gain excess returns.

Mining frequent itemsets and association rules is a popular and well researched approach for discovering interesting relationships between variables in large databases. The R package arules presented in this paper provides a basic infrastructure for creating and manipulating input data sets and for analyzing the resulting itemsets and rules. The package also includes interfaces to two fast mining algorithms, the popular C implementations of Apriori and Eclat by Christian Borgelt. These algorithms can be used to mine frequent itemsets, maximal frequent itemsets, closed frequent itemsets and association rules. (authors' abstract)

This thesis explains that the development of the law of the carriage of goods by sea has led to the appearance of the Hague, Hague-Visby and Hamburg Rules. The existence of these different conventions plainly contributes to the breakdown of uniformity. The thesis, nevertheless, argues that international uniformity is still valuable since it reduces the legal costs significantly. However, many conflicts arise among the various countries in interpreting these conventions. Such conflicts lead to uncertainty and unpredictability, and in consequence, to the increase of legal costs. In proving the latter, the thesis examines and evaluates the conflicts of interpretations of these conventions brought on by containerisation. The thesis proves the inadequacy of various propositions on the question of how to avoid such conflicts. It argues, however, that the failure to consider foreign decisions is a significant factor of having such conflicts. In proving the latter, the thesis provides a comparative study in evaluating various courts' decisions that relate to containerisation. The thesis, however, evaluates different measures to achieve international uniform interpretations. Most of these measures are not completely satisfactory solutions to such achievement. Accordingly, the thesis examines the obstacles that may face the applicability of comparative law in practice, and the capability of avoiding these obstacles. The thesis also offers various observations in relation to how the national courts shall consider comparative law. The key point is that the divergence that characterised the interpretation of the existing conventions will reappear unless there is some obligation on national courts to consider and apply comparative law. The thesis therefore proposes that any future convention relating to the law of carriage of goods by sea shall specify that the national courts of every contracting state shall refer to the decisions of the other contracting states when dealing with questions of interpretation.