Research ArticleOpen accessIn the abstractObject Recognition Based on Image Segmentation and ClusteringS. Thilagamani, N. ShanthiProblem statement: This study deals with object recognition based on image segmentation and clustering. Acquiring prior information of an image is done via two separate processes. Approach: The first process deals with detecting object parts of an image and integration of detected parts into several clusters. All these cluster centers form the visual words. The second process deals with over … …Journal of Computer Science, Vol. 7, Issue 11 · 6 Sep 2011 · 7,074 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Clustering Based Genetic Algorithm for Solving Complex NP ProblemsR. Sivaraj, T. RavichandranProblem statement: The selection process is a major factor in genetic algorithm which determines the optimality of solution for a complex problem. The selection pressure is the critical step which finds out the best individuals in the entire population for further genetic operators. The proposed algorithm tries to find out the best individuals with reduced selection pressure than standard genetic … …Journal of Computer Science, Vol. 7, Issue 7 · 28 Jun 2011 · 6,928 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Approach to Medical Image SegmentationNandagopalan Shanmugam, Adiga B. Suryanarayana, Sudarshan TSB et al.Problem statement: Segmentation is a vital aspect of medical imaging. It aids in the visualization of medical data and diagnostics of various diseases. Ultrasound image segmentation, in particular echocardiographic image segmentation, is required to identify the regions of interest such as Left Ventricle (LV) and other cardiac cavities. Existing methods do not address the drawbacks of speed and quality of … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,214 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,813 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnalysis of Decision Trees in Context Clustering of Hidden Markov Model Based Thai Speech SynthesisSuphattharachai ChomphanProblem statement: In Thai speech synthesis using Hidden Markov model (HMM) based synthesis system, the tonal speech quality is degraded due to tone distortion. This major problem must be treated appropriately to preserve the tone characteristics of each syllable unit. Since tone brings about the intelligibility of the synthesized speech. It is needed to establish the tone questions and other … …Journal of Computer Science, Vol. 7, Issue 3 · 7 Mar 2011 · 6,844 accessesView PDFCite
Research ArticleOpen accessIn the abstractTone Question of Tree Based Context Clustering for Hidden Markov Model Based Thai Speech SynthesisSuphattharachai ChomphanProblem statement: In HMM-based Thai speech synthesis, tone is an important issue that brings about the intelligibility of the synthesized speech. Tone distortion resulted from imbalance of the training data should be appropriately treated. Approach: This study described an HMM-based speech synthesis system for Thai language. In the system, spectrum, pitch and state duration are modeled simultaneously in a unified … …Journal of Computer Science, Vol. 6, Issue 12 · 9 Nov 2010 · 6,820 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrated Clustering and Feature Selection Scheme for Text Documents.M. Thangamani, P. ThangarajProblem statement: Text documents are the unstructured databases that contain raw data collection. The clustering techniques are used group up the text documents with reference to its similarity. Approach: The feature selection techniques were used to improve the efficiency and accuracy of clustering process. The feature selection was done by eliminate the redundant and irrelevant items from the text document … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,163 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimizing Feature Construction Process for Dynamic Aggregation of Relational AttributesRayner AlfredProblem statement: The importance of input representation has been recognized already in machine learning. Feature construction is one of the methods used to generate relevant features for learning data. This study addressed the question whether or not the descriptive accuracy of the DARA algorithm benefits from the feature construction process. In other words, this paper discusses the application of genetic … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 6,929 accessesView PDFCite
Research ArticleOpen accessIn the abstractDiscretization Numerical Data for Relational Data with One-to-Many RelationsRayner AlfredProblem statement: Handling numerical data stored in a relational database has been performed differently from handling those numerical data stored in a single table due to the multiple occurrences (one-to-many association) of an individual record in the non-target table and non-determinate relations between tables. Numbers in Multi-Relational Data Mining (MRDM) were often discretized, after considering the schema of the relational … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 7,030 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Physical Organization of R-Trees Using Node ClusteringF. Sagayaraj Francis, P. ThambiduraiR-Tree is a multidimensional indexing structure that forms basis for all the multidimensional indexing structures based on data partitioning. A number of attempts have been made in the past to improve the performance of R-Tree by manipulating the tree parameters and the data parameters. But hardly any attempt had been made to use external parameters such as disk parameters to … …Journal of Computer Science, Vol. 3, Issue 7 · 31 Jul 2007 · 6,627 accessesView PDFCite