2004
DOI: 10.1155/s1110865704309145
|View full text |Cite
|
Sign up to set email alerts
|

The Local Maximum Clustering Method and Its Application in Microarray Gene Expression Data Analysis

Abstract: An unsupervised data clustering method, called the local maximum clustering (LMC) method, is proposed for identifying clusters in experiment data sets based on research interest. A magnitude property is defined according to research purposes, and data sets are clustered around each local maximum of the magnitude property. By properly defining a magnitude property, this method can overcome many difficulties in microarray data clustering such as reduced projection in similarities, noises, and arbitrary gene dist… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2005
2005
2016
2016

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…From the tomographic volumes described above, 1,200 subvolumes (50 ϫ 50 ϫ 150 in pixels; 7.5 Å/pixel) were extracted from the ordered regions of the Caulobacter tomograms to create a stack of subvolumes. The subvolumes were classified by using the local-maximum clustering method (25), and the major clusters were averaged to create an initial template for further alignment and averaging. The subvolumes were aligned against the initial template by using the grid-threading Monte Carlo searching algorithm (26).…”
Section: Methodsmentioning
confidence: 99%
“…From the tomographic volumes described above, 1,200 subvolumes (50 ϫ 50 ϫ 150 in pixels; 7.5 Å/pixel) were extracted from the ordered regions of the Caulobacter tomograms to create a stack of subvolumes. The subvolumes were classified by using the local-maximum clustering method (25), and the major clusters were averaged to create an initial template for further alignment and averaging. The subvolumes were aligned against the initial template by using the grid-threading Monte Carlo searching algorithm (26).…”
Section: Methodsmentioning
confidence: 99%
“…It is mainly composed of four steps: 1) calculate the filter response using Eq. (5) with γ = 2 and a set of σ ∈ [ σ min , σ max ]; 2) exploit the distance map to constrain the maximal scale and obtain R(x,y)=argmaxσ[σmin,σMAX]2L(x,y;σ), where σ MAX = max{ σ min , min{ σ max , 2 × D ( x, y )}} and D ( x, y ) represents distance map; 3) seek local maxima of R ( x, y ) as seeds; 4) use a local-maximum clustering algorithm [88] to remove false seeds caused by minor peaks in the distance map. Instead of using local-maxima clustering, Chang et al [69] have exploited the response strength and the blue ratio intensity to constrain the LoG based nucleus marker selection on H&E stained histopathology images.…”
Section: Nucleus and Cell Detection Methodsmentioning
confidence: 99%
“…η ( L v , L u ) = 1 if L v ≠ L u , otherwise 0. σ is a fixed parameter. After foreground segmentation, nuclei are initially segmented with LoG detection followed by size-constrained clustering [88]. Finally, graph cut with α -expansion [277] and graph coloring [233] are used to refine the initial segmented contours.…”
Section: Nucleus and Cell Segmentation Methodsmentioning
confidence: 99%
“…30 The distances between conformations are calculated as the sum of the difference square of the backbone dihedral angles. Figure 10 shows the representative structures of these six major clusters.…”
Section: Folding Of a Pentamer Peptidementioning
confidence: 99%