A Combinational Fuzzy Clustering Approach for Microarray Spot Segmentation

Author(s):  
Ong Pauline ◽  
Zarita Zainuddin

Due to microarray experiment imperfection, spots with various artifacts are often found in microarray image. A more rigorous spot recognition approach in ensuring successful image analysis is crucial. In this paper, a novel hybrid algorithm was proposed. A wavelet approach was applied, along with an intensity-based shape detection simultaneously to locate the contour of the microarray spots. The proposed algorithm segmented all the imperfect spots accurately. Performance assessment with the classical methods, i.e., the fixed circle, adaptive circle, adaptive shape and histogram segmentation showed that the proposed hybrid approach outperformed these methods.

Author(s):  
Karthik S. A. ◽  
Manjunath S. S.

In cDNA microarray image analysis, classification of pixels as forefront area and the area covered by background is very challenging. In microarray experimentation, identifying forefront area of desired spots is nothing but computation of forefront pixels concentration, area covered by spot and shape of the spots. In this piece of writing, an innovative way for spot partitioning of microarray images using autonomously organizing maps (AOM) method through C-V model has been proposed. Concept of neural networks has been incorpated to train and to test microarray spots.In a trained AOM the comprehensive information arising from the prototypes of created neurons are clearly integrated to decide whether to get smaller or get bigger of contour. During the process of optimization, this is done in an iterative manner. Next using C-V model, inside curve area of trained spot is compared with test spot finally curve fitting is done.The presented model can handle spots with variations in terms of shape and quality of the spots and meanwhile it is robust to the noise. From the review of experimental work, presented approach is accurate over the approaches like C-means by fuzzy, Morphology sectionalization.


Author(s):  
Weiping Ding ◽  
Shouvik Chakraborty ◽  
Kalyani Mali ◽  
Sankhadeep Chatterjee ◽  
Janmenjoy Nayak ◽  
...  

2011 ◽  
Vol 145 ◽  
pp. 292-296
Author(s):  
Lee Wen Huang

Data Mining means a process of nontrivial extraction of implicit, previously and potentially useful information from data in databases. Mining closed large itemsets is a further work of mining association rules, which aims to find the set of necessary subsets of large itemsets that could be representative of all large itemsets. In this paper, we design a hybrid approach, considering the character of data, to mine the closed large itemsets efficiently. Two features of market basket analysis are considered – the number of items is large; the number of associated items for each item is small. Combining the cut-point method and the hash concept, the new algorithm can find the closed large itemsets efficiently. The simulation results show that the new algorithm outperforms the FP-CLOSE algorithm in the execution time and the space of storage.


Author(s):  
Noureddine El Harchaoui ◽  
Samir Bara ◽  
Mounir Ait Kerroum ◽  
Ahmed Hammouch ◽  
Mohamed Ouadou ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document