2016
DOI: 10.21859/jet-060223
|View full text |Cite
|
Sign up to set email alerts
|

A Comparative Study of Clustering and Biclustering of Microarray Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 50 publications
0
2
0
Order By: Relevance
“…Figure 6 depicts an example of SOM network. We use the SOM algorithm for two main reasons: (1) it is a well-known approach for performing successfully data clustering and vector quantization [28,29]; (2) it has been proved that SOM algorithm converges when applied to one-dimensional features [30,31]. Each cluster defines areas of laptops' points determining a given range of magnetic field radiation for the laptops.…”
Section: Model Analysis By Self-organizing Map Clusteringmentioning
confidence: 99%
“…Figure 6 depicts an example of SOM network. We use the SOM algorithm for two main reasons: (1) it is a well-known approach for performing successfully data clustering and vector quantization [28,29]; (2) it has been proved that SOM algorithm converges when applied to one-dimensional features [30,31]. Each cluster defines areas of laptops' points determining a given range of magnetic field radiation for the laptops.…”
Section: Model Analysis By Self-organizing Map Clusteringmentioning
confidence: 99%
“…Biclustering methods are proved to be NP-hard problem [ 13 ]. Therefore, according to the solution of the algorithm, the biclustering algorithms can be classified into various types [ 14 , 15 ]. Nevertheless, two major categories can be classified from the data, binary biclustering and non-binary biclustering algorithms.…”
Section: Introductionmentioning
confidence: 99%