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 abstractSingle Pass Seed Selection Algorithm for k-MeansK. Karteeka Pavan, Allam Appa Rao, A.V. Dattatreya Rao, G. R. SridharProblem statement: The k-means method is one of the most widely used clustering techniques for various applications. However, the k-means often converges to local optimum and the result depends on the initial seeds. Inappropriate choice of initial seeds may yield poor results. k-means++ is a way of initializing k-means by choosing initial seeds with specific probabilities. Due to the random … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,541 accessesView PDFCite
Research ArticleOpen accessIn the abstractUtility Independent Privacy Preserving Data Mining on Vertically Partitioned DataE. Poovammal, M. PonnavaikkoProblem statement: Driven by mutual benefits, or by regulations that require certain data to be published, there has been a demand for the exchange and publication of data among various parties. Data publishing has been ubiquitous in many domains such as medical, business and education. Detailed person-specific data, present in the centralized server or in the distributed environment, in its … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 6,835 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 abstractThe Parallel Maximal Cliques Algorithm for Protein Sequence ClusteringKhalid Jaber, Nur’Aini Abdul Rashid, Rosni AbdullahProblem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced a … …American Journal of Applied Sciences, Vol. 6, Issue 7 · 31 Jul 2009 · 7,100 accessesView PDFCite
Research ArticleOpen accessIn the abstractNew Efficient Strategy to Accelerate k-Means Clustering AlgorithmMoh’d Belal Al- Zoubi, Amjad Hudaib, Ammar Huneiti, Bassam HammoOne of the most popular clustering techniques is the k-means clustering algorithm. However, the utilization of the k-means is severely limited by its high computational complexity. In this study, we propose a new strategy to accelerate the k-means clustering algorithm through the Partial Distance (PD) logic. The proposed strategy avoids many unnecessary distance calculations by applying efficient PD strategy. Experiments … …American Journal of Applied Sciences, Vol. 5, Issue 9 · 30 Sep 2008 · 7,437 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Studying Spatial Patterns and Association Between these Patterns of Mortality and Prosperity in MalaysiaFaisal G. Khamis, Abdul Aziz Jemain, Kamarulzaman IbrahimIn this study, we examined the geographical distribution (the spatial structure) of mortality and prosperity in Malaysia. In addition we proposed an approach to investigate the association between clustering patterns of mortality and prosperity across different areas of the country. To characterize the geographic pattern of mortality and prosperity, three indicators (infant, neonatal, and stillbirth) were proposed for mortality and … …American Journal of Applied Sciences, Vol. 5, Issue 7 · 31 Jul 2008 · 6,935 accessesView PDFCite
Research ArticleOpen accessIn the abstractImproving Quality of Clustering using Cellular Automata for Information retrievalP. K. Sree, G. V.S. Raju, I. R. Babu, S. V. RajuClustering has been widely applied to Information Retrieval (IR) on the grounds of its potential improved effectiveness over inverted file search. Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set .A clustering quality measure is a function that, given a data … …Journal of Computer Science, Vol. 4, Issue 2 · 28 Feb 2008 · 7,033 accessesView PDFCite
Research ArticleOpen accessIn the abstractFeature Selection in Data-Mining for Genetics Using Genetic AlgorithmV. N. Rajavarman, S. P. RajagopalanWe discovered genetic features and environmental factors which were involved in multifactorial diseases. To exploit the massive data obtained from the experiments conducted at the General Hospital, Chennai, data mining tools were required and we proposed a 2-Phase approach using a specific genetic algorithm. This heuristic approach had been chosen as the number of features to consider was large (upto … …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,627 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