Discovering interesting association rules from legal databases
- Ivkovic, Sasha, Yearwood, John, Stranieri, Andrew
- Authors: Ivkovic, Sasha , Yearwood, John , Stranieri, Andrew
- Date: 2002
- Type: Text , Journal article
- Relation: Information & Communication Technology Law Vol. 11, no. 1 (2002), p. 35-47
- Full Text:
- Reviewed:
- Description: The Knowledge Discovery from Databases (KDD) technique called 'association rules' is applied to a large data set representing applicants for government-funded legal aid. Results indicate that KDD can be an invaluable tool for legal analysts. Association rules discovered identify associations between variables that are present in the data set though are not necessarily causal. Interesting rules can prompt analysts to formulate hypotheses for further investigation. The identification of interesting rules is typically performed using an objective measure of 'interesting' although this measure is often not sufficiently accurate to eliminate all uninteresting rules. In this article, a subjective measure of interestingness is adopted in conjunction with the objective measures. This leads to the ability to focus more accurately on those rules that surprise the analyst and are therefore more likely to be interesting. In general, KDD techniques have not been applied to law despite possible benefits because data is often stored in narrative form rather than in structured databases. However, the impending introduction of data warehouses that collect data from a number of organizations across a legal system presents invaluable opportunities for analysts using KDD.
- Description: C1
- Description: 2003000037
- Authors: Ivkovic, Sasha , Yearwood, John , Stranieri, Andrew
- Date: 2002
- Type: Text , Journal article
- Relation: Information & Communication Technology Law Vol. 11, no. 1 (2002), p. 35-47
- Full Text:
- Reviewed:
- Description: The Knowledge Discovery from Databases (KDD) technique called 'association rules' is applied to a large data set representing applicants for government-funded legal aid. Results indicate that KDD can be an invaluable tool for legal analysts. Association rules discovered identify associations between variables that are present in the data set though are not necessarily causal. Interesting rules can prompt analysts to formulate hypotheses for further investigation. The identification of interesting rules is typically performed using an objective measure of 'interesting' although this measure is often not sufficiently accurate to eliminate all uninteresting rules. In this article, a subjective measure of interestingness is adopted in conjunction with the objective measures. This leads to the ability to focus more accurately on those rules that surprise the analyst and are therefore more likely to be interesting. In general, KDD techniques have not been applied to law despite possible benefits because data is often stored in narrative form rather than in structured databases. However, the impending introduction of data warehouses that collect data from a number of organizations across a legal system presents invaluable opportunities for analysts using KDD.
- Description: C1
- Description: 2003000037
New algorithms for multi-class cancer diagnosis using tumor gene expression signatures
- Bagirov, Adil, Ferguson, Brent, Ivkovic, Sasha, Saunders, Gary, Yearwood, John
- Authors: Bagirov, Adil , Ferguson, Brent , Ivkovic, Sasha , Saunders, Gary , Yearwood, John
- Date: 2003
- Type: Text , Journal article
- Relation: Bioinformatics Vol. 19, no. 14 (2003), p. 1800-1807
- Full Text:
- Reviewed:
- Description: Motivation: The increasing use of DNA microarray-based tumor gene expression profiles for cancer diagnosis requires mathematical methods with high accuracy for solving clustering, feature selection and classification problems of gene expression data. Results: New algorithms are developed for solving clustering, feature selection and classification problems of gene expression data. The clustering algorithm is based on optimization techniques and allows the calculation of clusters step-by-step. This approach allows us to find as many clusters as a data set contains with respect to some tolerance. Feature selection is crucial for a gene expression database. Our feature selection algorithm is based on calculating overlaps of different genes. The database used, contains over 16 000 genes and this number is considerably reduced by feature selection. We propose a classification algorithm where each tissue sample is considered as the center of a cluster which is a ball. The results of numerical experiments confirm that the classification algorithm in combination with the feature selection algorithm perform slightly better than the published results for multi-class classifiers based on support vector machines for this data set.
- Description: C1
- Description: 2003000439
- Authors: Bagirov, Adil , Ferguson, Brent , Ivkovic, Sasha , Saunders, Gary , Yearwood, John
- Date: 2003
- Type: Text , Journal article
- Relation: Bioinformatics Vol. 19, no. 14 (2003), p. 1800-1807
- Full Text:
- Reviewed:
- Description: Motivation: The increasing use of DNA microarray-based tumor gene expression profiles for cancer diagnosis requires mathematical methods with high accuracy for solving clustering, feature selection and classification problems of gene expression data. Results: New algorithms are developed for solving clustering, feature selection and classification problems of gene expression data. The clustering algorithm is based on optimization techniques and allows the calculation of clusters step-by-step. This approach allows us to find as many clusters as a data set contains with respect to some tolerance. Feature selection is crucial for a gene expression database. Our feature selection algorithm is based on calculating overlaps of different genes. The database used, contains over 16 000 genes and this number is considerably reduced by feature selection. We propose a classification algorithm where each tissue sample is considered as the center of a cluster which is a ball. The results of numerical experiments confirm that the classification algorithm in combination with the feature selection algorithm perform slightly better than the published results for multi-class classifiers based on support vector machines for this data set.
- Description: C1
- Description: 2003000439
Applying anatomical therapeutic chemical (ATC) and critical term ontologies to Australian drug safety data for association rules and adverse event signalling
- Saunders, Gary, Ivkovic, Sasha, Ghosh, Ranadhir, Yearwood, John
- Authors: Saunders, Gary , Ivkovic, Sasha , Ghosh, Ranadhir , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Conferences in Research and Practice in Information Technology, Advances in Ontologies 2005: Proceedings of the Australasian Ontology Workshop AOW 2005 Vol. 58, no. (2005), p. 93-98
- Full Text:
- Reviewed:
- Description: C1
- Description: 2003001450
- Authors: Saunders, Gary , Ivkovic, Sasha , Ghosh, Ranadhir , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Conferences in Research and Practice in Information Technology, Advances in Ontologies 2005: Proceedings of the Australasian Ontology Workshop AOW 2005 Vol. 58, no. (2005), p. 93-98
- Full Text:
- Reviewed:
- Description: C1
- Description: 2003001450
Using association and overlapping time window approach to detect drug reaction signals
- Ivkovic, Sasha, Saunders, Gary, Ghosh, Ranadhir, Yearwood, John
- Authors: Ivkovic, Sasha , Saunders, Gary , Ghosh, Ranadhir , Yearwood, John
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at CIMCA 2005 International Conference on Computational Intelligence for Modelling Control & Automation jointly with IAWTIC 2005 International Conference on Intelligent Agents, Web Technologies & Internet Commerce, Vienna, Austria : 28th November, 2005 p. 1045-1053
- Full Text:
- Reviewed:
- Description: The problem with detecting adverse drug reactions (ADRs) from drugs is that they may not be obvious until long after they are widely prescribed. Part of the problem is these events are rare. This work describes an approach to signal detection of ADRs based on association rules (AR) in Australian drug safety data. This work was carried out using the Australian Adverse Drug Reactions Advisory Committee (ADRAC) database, which contains a hundred and thirty seven thousand records collected in 1972-2001 period. Many signal detection methods have been developed for drug safety data, most of which use a classical statistical approach. Some of these stratify the data using an ontology for reactions, but the application of drug ontologies to ADR signal detection methods has not been reported. We propose a novel approach for detecting various signal levels by using an overlapped windowing approach. The overlapping windows help to detect smooth transition of signal. We use association rules for measuring significant change over time for different hierarchical levels of drugs (using the Anatomical-Therapeutic-Chemical (ATC) system of drug classification ontology) and their reactions based on the System Organ Classes (SOC) ontology. Using association rules and their strength for different levels in the drug and reaction hierarchy, helps in the detection of signals at particular levels in higher order using a bottom up approach. The results of a preliminary investigation of ADRAC data using our method demonstrate that this approach could produce a powerful and robust ADR signal detection method.
- Description: E1
- Description: 2003001838
- Authors: Ivkovic, Sasha , Saunders, Gary , Ghosh, Ranadhir , Yearwood, John
- Date: 2006
- Type: Text , Conference paper
- Relation: Paper presented at CIMCA 2005 International Conference on Computational Intelligence for Modelling Control & Automation jointly with IAWTIC 2005 International Conference on Intelligent Agents, Web Technologies & Internet Commerce, Vienna, Austria : 28th November, 2005 p. 1045-1053
- Full Text:
- Reviewed:
- Description: The problem with detecting adverse drug reactions (ADRs) from drugs is that they may not be obvious until long after they are widely prescribed. Part of the problem is these events are rare. This work describes an approach to signal detection of ADRs based on association rules (AR) in Australian drug safety data. This work was carried out using the Australian Adverse Drug Reactions Advisory Committee (ADRAC) database, which contains a hundred and thirty seven thousand records collected in 1972-2001 period. Many signal detection methods have been developed for drug safety data, most of which use a classical statistical approach. Some of these stratify the data using an ontology for reactions, but the application of drug ontologies to ADR signal detection methods has not been reported. We propose a novel approach for detecting various signal levels by using an overlapped windowing approach. The overlapping windows help to detect smooth transition of signal. We use association rules for measuring significant change over time for different hierarchical levels of drugs (using the Anatomical-Therapeutic-Chemical (ATC) system of drug classification ontology) and their reactions based on the System Organ Classes (SOC) ontology. Using association rules and their strength for different levels in the drug and reaction hierarchy, helps in the detection of signals at particular levels in higher order using a bottom up approach. The results of a preliminary investigation of ADRAC data using our method demonstrate that this approach could produce a powerful and robust ADR signal detection method.
- Description: E1
- Description: 2003001838
- «
- ‹
- 1
- ›
- »