SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Scalable Rule-Based Gene Expression Data Classification

hawa avatar
hawa
16 diapositives · 299 Views · Oct 04, 2014

This research explores a novel approach for gene expression data classification using a Boolean Structure Table Classifier (BSTC). The methodology operates in two phases: mining association rules from training data and classifying query samples based on these rules. It addresses the challenges of exponential search in association rule mining and presents a heuristic classifier that maintains accuracy while significantly improving runtime efficiency. The experiments demonstrate that BSTC outperforms traditional classifiers, retaining high accuracy on large datasets without needing complex parameter tuning.

#scalable rule-based gene expression data classification #scalable rule-based gene expression data classification ppt #powerpoint #presentation
Scalable Rule-Based Gene Expression Data Classification - slide 1
01 / 16Scalable Rule-Based Gene Expression Data Classification
1 / 17

Télécharger la présentation

Scalable Rule-Based Gene Expression Data Classification
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Scalable Rule-Based Gene Expression Data Classification Mark A. Iwen Department of Mathematics Willis Lang, Jignesh M. Patel EECS Department University of Michigan, USA (ICDE 2008)

  2. Outline • Introduction • Preliminaries • Method– Boolean Structure Table(BST) Boolean Structure Table Classifier (BSTC) • Experiments • Conclusions

  3. Introduction • association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (ii) Classification of query data using the mined rules • require an exponential search of the training data set’s samples • heuristic rule-based gene expression data classifier

  4. Introduction • g1,g2 → cancer • g5, g6 → healthy

  5. Preliminaries • A finite set G of genes and N collections of subsets from G • Ci : class type or class label • si,j ⊂ G as a sample • every element g ∈ G as a gene • C1 ={s1,1, . . . , s1,m1}, . . . , CN = {sN,1, . . . , sN,mN} • if g ∈ G , g ∈ si,jwe will say that samplesi,jexpressesgene g

  6. Preliminaries • Conjunctive associationrule (CAR) • If a query sample s contains all genes gj1, . . . , gjr then it should be grouped with class type Cn. gj1, . . . , gjr⇒ n • Support: • Confidence:

  7. Preliminaries • CARg1, g3 ⇒ Cancer • Support = 2, conf = 1

  8. Preliminaries • Boolean association rule (BAR) • if B(s[g1], . . . , s[gn]) evaluates to true for a given sample s,then s should belong to class Ci.” • Support • Confidence • B(x1, x2, x3, x4, x5, x6) = (x1 ∧ x3) ∨ (x2 ∧ x4) • support 3 and confidence 1

  9. Boolean Structure Table(BST) • if g ∈ G , g ∈ si,jwe will say that samplesi,jexpressesgene g

  10. Boolean association rule (BAR) • Gene Row BARs with 100% Confidence Values • Gene g1: (g1 expressed) ⇒ Cancer. • Gene g2: (g2 expressed AND [EITHER (g1 expressed) OR (either g5 or g3 not expressed)] ) ⇒ Cancer. • Gene g3: (g3 expressed AND [EITHER {(g1 expressed) AND (either g4 or g6 not expressed)} OR { (either g2 or g5 not expressed) AND (either g4 or g5 not expressed)} ] ) ⇒ Cancer. • … • exclusion list

  11. Why BARs with 100% Confidence? • We remove all exclusion list clauses related to sample row s5 • (g3 expressed AND [EITHER (g1 expressed) OR (either g2 or g5 not expressed) ] ⇒ Cancer • Confidence = • theorem CAR , exists a 100% confident BST generated BAR B ⇒ C supp( ) = supp, non-C samples.

  12. Boolean Structure Table Classifier (BSTC) • BSTEC (T(i),Q) • Q = {g1 expressed, g2 not expressed, g3 not expressed, g4 expressed, g5 expressed, g6 not expressed} • Healthy classification value of 3/8

  13. Runtime Complexity for BST Creation • C1, . . . , CNis • BSTs canbe constructed for all Cis in time

  14. Runtime Complexity for BST • construct all the BSTs T(1), . . . , T (N) • Thus,BSTC requires time and space O (|S|^2・|G|) • during classification BSTC must calculate BSTCE(T(i),Q) for 1 ≤ i ≤ N. BSTCE runs in O ((|S| − |Ci|)・|G|・|Ci|) time per query sample • worst case evaluation time is also O(|S|^2・|G|) per query sample

  15. Experiments

  16. Conclusions • BSTC retains the classification accuracy of current association rule-based methods while being orders of magnitude faster than the leading classifier RCBT on large datasets • Rulebased classifiers: (i) BSTC is easy to use (requires no parameter tuning) (ii) BSTC can easily handle datasets with any number of class types