2008
DOI: 10.1371/journal.pone.0001806
|View full text |Cite
|
Sign up to set email alerts
|

Estimation of Relevant Variables on High-Dimensional Biological Patterns Using Iterated Weighted Kernel Functions

Abstract: BackgroundThe analysis of complex proteomic and genomic profiles involves the identification of significant markers within a set of hundreds or even thousands of variables that represent a high-dimensional problem space. The occurrence of noise, redundancy or combinatorial interactions in the profile makes the selection of relevant variables harder.Methodology/Principal FindingsHere we propose a method to select variables based on estimated relevance to hidden patterns. Our method combines a weighted-kernel di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
12
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 28 publications
1
12
0
Order By: Relevance
“…We approve that our results are similar with other studies. For instance, Rojas-Galeano et al [27] gets 88% with their kernel-based algorithm. Futschik et al [2] reported that Colon dataset gives lower accuracy compared to other datasets.…”
Section: Resultsmentioning
confidence: 99%
“…We approve that our results are similar with other studies. For instance, Rojas-Galeano et al [27] gets 88% with their kernel-based algorithm. Futschik et al [2] reported that Colon dataset gives lower accuracy compared to other datasets.…”
Section: Resultsmentioning
confidence: 99%
“…The aim there is to select an optimal subset of relevant variables for a classification problem; the relevant found subset can be further analysed by experts for specific purposes (in biology for example, features may represent over-expressed gene activity due to an illness condition). In the so-called wrapper scheme of the problem [18] the classifier is enabled to incorporate the selection mechanism during the learning stage: a weighted kernel classifier, for example, may use an UMDA component to define relevance coefficients for the variables and then use them as input for the kernel machine (that is the approach taken in [16]). Currently these type of mechanisms are hidden in the current implementation of classifier or clustering components of Orange.…”
Section: Discussionmentioning
confidence: 99%
“…variables) in order to modulate their contribution to the total computation [14, 26, 27]. The weighted RBF and weighted polynomial kernels are then defined as , and , respectively.…”
Section: Methodsmentioning
confidence: 99%
“…Previous studies considered combining classical and probabilistic genetic algorithms with weighted kernel classifiers for relevancy–only discovery [14, 15]; our contribution in this paper is to extend those approaches to take advantage of the discrimination power of a weighted kernel classifier to guide the search for a probabilistic model that simultaneously estimates marginal and interacting effects among the features in a discrimination problem.…”
Section: Introductionmentioning
confidence: 99%