PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Rule based functional description of genes – Estimation of the multicriteria rule interestingness measure by the UTA method

Autorzy
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper we present new extension of RuleGO rule generation method. The method was designed to discover logical rules including combination of GO terms in their premises in order to provide functional description of analyzed gene signatures. As the number of obtained rules is typically huge, filtration algorithm is required to select only the most interesting ones. Rule interestingness measures currently used within the RuleGO method do not always allow for the selection of the rules according to user's subjective preferences. In this paper we propose an application of the UTA method for estimation of the multicriteria rule interestingness measure reflecting expert's subjective rule evaluation. In the presented method, each of the rules is characterized by a vector of values reflecting its quality due to the different parial interestingness measures. From the designated set of rules a set of representative rules is selected and presented to an expert who orders the rules based on his preferences. Using the information about the order and values of the partial interestingness measures, the additive multicriteria interestingness measure is estimated. The measure is estimated in such a way that the rule ranking obtained by this function is consistent with the ranking given by an expert. The presented approach is applied to three microarray data sets and obtained rule orders are compared with rule orders generated with the standard RuleGO rule evaluation method. Presented method allows obtaining the rule ranking that is better correlated with expert ranking than the ranking obtained in the standard way.
Twórcy
autor
  • Institute of Informatics, Silesian University of Technology, ul. Akademicka 16, 44-100 Gliwice, Poland
autor
  • Institute of Informatics, Silesian University of Technology, Gliwice, Poland; Institute of Innovative Technologies EMAG, Katowice, Poland
Bibliografia
  • [1] Baldi P, Hatfield GW. DNA microarrays and gene expression. Cambridge: Cambridge University Press; 2002.
  • [2] Wang Z, Gerstein M, Snyder M. RNA-Seq: a revolutionary tool for transcriptomics. Nat Rev Genet 2009; 10: 57–63.
  • [3] Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, Cherry JM, et al. Gene Ontology: tool for the unification of biology. Nat Genet 2000; 25(1): 25–9.
  • [4] Maere S, Heymans K, Kuiper M. BiNGO: a cytoscape plugin to assess overrepresentation of gene ontology categories in biological networks. Bioinformatics 2005; 21: 3448–9.
  • [5] Al-Shahrour F, Minguez P, Vaquerizas JM, Conde L, Dopazo J. BABELOMICS: a suite of web tools for functional annotation and analysis of groups of genes in high-throughput experiments. Nucleic Acids Res 2005; 33(web server issue): W460–4.
  • [6] Khatri P, Draghici S. Ontological analysis of gene expression data: current tools, limitations, and open problems. Bioinformatics 2005; 21(18): 3587–95.
  • [7] Hvidsten TR, Legreid A, Komorowski HJ. Learning rule-based models of biological process from gene expression time profiles using gene ontology. Bioinformatics 2003; 19(9): 1116–23.
  • [8] Midelfart H. Supervised learning in the gene ontology. Part I. A rough set framework. Trans Rough Sets IV 2005; 3700: 98–124.
  • [9] Midelfart H. Supervised learning in the gene ontology. Part II. A bottom-up algorithm. Trans Rough Sets IV 2005; 3700: 69–97.
  • [10] Carmona-Saez P, Chagoyen M, Rodriguez A, Trelles O, Carazo JM, Pascual-Montano A. Integrated analysis of gene expression by association rules discovery. BMC Bioinformatics 2006; 7(1): 54.
  • [11] Nogales-Cadenas R, Carmona-Saez P, Vazquez M, Vicente C, Yang X, Tirado F, et al. GeneCodis: interpreting gene lists through enrichment analysis and integration of diverse biological information. Nucleic Acids Res 2009;37(Suppl. 2): W317–22.
  • [12] Agrawal R, Srikant R. Fast algorithms for mining association rules. Morgan: Kaufmann; 1994: 487–99.
  • [13] Hackenberg Mi, Matthiesen R. Annotation-modules: a tool for finding significant combinations of multisource annotations for gene lists. Bioinformatics 2008; 24(11): 1386–93.
  • [14] Sikora M, Gruca A. Quality improvement of rule-based gene group descriptions using information about GO terms importance occurring in premises of determined rules. Appl Math Comput Sci 2010; 20(3): 555–70.
  • [15] Sikora M, Gruca A. Induction and selection of the most interesting gene ontology based multiattribute rules for descriptions of gene groups. Pattern Recogn Lett 2011; 32 (2): 258–69.
  • [16] Geng L, Hamilton HJ. Interestingness measures for data mining: a survey. ACM Comput Surv 2006; 38(3): 9.
  • [17] MacGarry K. A survey of interestingness measures for knowledge discovery. Knowl Eng Rev 2005; 20(1): 39–61.
  • [18] Gruca A, Sikora M, Polanski A. RuleGO: a logical rules-based tool for description of gene groups by means of gene ontology. Nucleic Acids Res 2011; 39,(Suppl. 2): W293–301.
  • [19] Jacquet-Lagrae E, Siskos Y. Assessing a set of additive utility functions for multicriteria decision making: the UTA method. Eur J Oper Res 1982; 10(2): 151–64.
  • [20] Siskos Y, Grigoroudis E, Matsatsinis NF. UTA methods. In: José Figueira J, Greco S, Ehrogott M, editors. Multiple criteria decision analysis: state of the art surveys, vol. 78. Springer; 2005. p. 297–334.
  • [21] Andersen TL, Martinez TR. NP-completeness of minimum rule sets. In: Proceedings of the 10th International Symposium on Computer and Information; 1995. pp. 411–8.
  • [22] Agotnes T, Komorowski J, Loken T. Taming large rule models in rough set approaches. In: Żykow JM, Rauch J, editors. Principles of data mining and knowledge discovery, vol. 1704. LNAI, Springer; 1999. p. 193–203.
  • [23] Fürnkranz J. Pruning algorithms for rule learning. Mach Learn 1997; 27(2): 139–71.
  • [24] Stańczyk U. Decision rule length as a basic for evaluation of attribute relevance. J Intell Fuzzy Syst 2013; 24: 429–45.
  • [25] Ishibuchi H, Yamamoto T. Effect of three-objective genetic rule selection on the generalization ability of fuzzy rule-based systems. Lect Notes Comput Sci 2003; 2632: 608–22.
  • [26] Sikora M. Decision rule-based data models using TRS and NetTRS—methods and algorithms. Trans Rough Sets 2010; 11: 130–60.
  • [27] Sikora M, Wrobel L. Data-driven adaptive selection of rules quality measures for improving the rules induction algorithm. In: Sergei O, Kuznetsov SO, Ślęzak D, Hepting DH, Mirkin BG, editors. Rough sets fuzzy sets data mining and granular computing, vol. 6743. LNCS, Springer; 2011. p. 278–85.
  • [28] Gamberger D, Lavrac N. Confirmation rule sets. In: Proc. of 4th European Conference on Principles of Data Mining and Knowledge Discovery. 2000. pp. 34–43.
  • [29] Gupta GK, Strehl A, Ghosh J. Distance based clustering of association rules. In: Dagli CH, editor. Intelligent engineering systems through artificial neural networks. ASME Press; 1999. pp. 759–64.
  • [30] Tsumoto S, Hirano S. Visualization of Rule's similarity using multidimensional scaling. In: Third IEEE International Conference on Data Mining. 2003. pp. 339–46.
  • [31] Bayardo RJ, Agrawal R. Mining the most interesting rules. In: ACM. 1999. pp. 145–54.
  • [32] Brzezińska I, Greco S, Słowiński R. Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support. Eng Appl Artif Intell 2007; 20(5): 587–600.
  • [33] Abe H, Tsumoto S, Oshaki M, Yamaguchi T. Evaluation learning algorithms to construct rule evaluation models based on objective rule evaluation indices. IEEE Comput Soc 2007; 212–21.
  • [34] Abe H, Tsumoto S. Comparing accuracies of rule evaluation models to determine human criteria on evaluated rule sets. IEEE Comput Soc 2008; 1–7.
  • [35] Lenca P, Meyer P, Vaillant B, Lallich S. A multicriteria decision aid for interestingness measure selection. LUSSI Department, GET/ENST; 2004.
  • [36] Brans JP, Mareschal B. Promethee methods. In: José Figueira J, Greco S, Ehrogott M, editors. Multiple criteria decision analysis: state of the art surveys, vol. 78. Springer; 2005. p. 163–86.
  • [37] Stefanowski J, Vanderpooten D. Induction of decision rules in classification and discovery-oriented perspectives. Int J Intell Syst 2001; 16(1): 13–27.
  • [38] An A, Cercone N. Rule quality measures for rule induction systems: description and evaluation. Comput Intell 2001; 17 (3): 409–24.
  • [39] Sikora M. Rule quality measures in creation and reduction of data role models. Lect Notes Artif Intell 2006; 4259: 716–25.
  • [40] Fürnkranz J, Flach PA. ROC 'n' rule learning—towards a better understanding of covering algorithms. Mach Learn 2005; 58(1): 39–77.
  • [41] Guillet F, Hamilton HJ. Quality measures in data mining (studies in computational intelligence). New York: Springer-Verlag Inc.; 2007.
  • [42] Kavsek B, Lavrac N. APRIORI-SD: adapting association rule learning to subgroup discovery. Appl Artif Intell 2006; 20: 543–83.
  • [43] Gruca A. Characterization of gene groups using decision (in Polish). Gliwice, Poland: Silesian University of Technology; 2009 [PhD thesis].
  • [44] Blanchard J, Guillet F, Kuntz P. Semantic-based classification of rule interestingness measures. In: Zhao Y, Zhang Ch., Cao L, editors. Post-mining of association rules: techniques for effective knowledge extraction. IGI Global; 2009. pp. 56–79.
  • [45] Eisen MB, Spellman PT, Brown PO, Botstein D. Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci USA 1998; 95 (25): 14863–8.
  • [46] Iyer VR, Eisen MB, Ross DT, Schuler G, Moore T, Lee JC, et al. The transcriptional program in the response of human fibroblasts to serum. Science 1999; 283(5398): 83–7.
  • [47] Cho RJ, Huang M, Campbell MJ, Dong H, Steinmetz L, Sapinoso L, et al. Transcriptional regulation and function during the human cell cycle. Nat Genet 2001; 27: 48–54.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-e43ded50-39ab-4f70-a8bb-55239dfff90d
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.