19 results for “Distributed clustering algorithm”

Set a search alert

Research ArticleOpen accessIn the abstractMatching LSI for Scalable Information RetrievalRajagopal Palsonkennedy, T. V. GopalLatent Semantic Indexing (LSI) is one of the well-liked techniques in the information retrieval fields. Different from the traditional information retrieval techniques, LSI is not based on the keyword matching simply. It uses statistics and algebraic computations. Based on Singular Value Decomposition (SVD), the higher dimensional matrix is converted to a lower dimensional approximate matrix, of which the noises could … …Journal of Computer Science, Vol. 8, Issue 12 · 2 Jan 2013 · 6,668 accessesView PDF Cite

Research ArticleOpen accessIn the abstractImproving the Performance of Multivariate Bernoulli Model based Documents Clustering Algorithms using Transformation TechniquesPerumal Pitchandi, Nedunchezhian RajuProblem statement: Document clustering is the most important areas of data mining since they are very much and currently the subject of significant global research since such areas strengthen the enterprises of web intelligence, web mining, web search engine design and so forth. Generative models based on the multivariate Bernoulli and multinomial distributions have been widely used for text classification. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,281 accessesView PDF Cite

Research ArticleOpen accessIn the abstractStrength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer NetworksSubbaraj Potti, Chitra ChinnasamyProblem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing … …Journal of Computer Science, Vol. 7, Issue 1 · 16 Dec 2010 · 8,216 accessesView PDF Cite

Research ArticleOpen accessIn the abstractComputational Complexity between K-Means and K-Medoids Clustering Algorithms for Normal and Uniform Distributions of Data PointsT. Velmurugan, T. SanthanamProblem statement: Clustering is one of the most important research areas in the field of data mining. Clustering means creating groups of objects based on their features in such a way that the objects belonging to the same groups are similar and those belonging to different groups are dissimilar. Clustering is an unsupervised learning technique. The main advantage of clustering … …Journal of Computer Science, Vol. 6, Issue 3 · 31 Mar 2010 · 19,434 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDynamic Head Cluster Election Algorithm for Clustered Ad-Hoc NetworksArwa Zabian, Ahmed Ibrahim, Fadi Al-KalaniIn distributed system, the concept of clustering consists on dividing the geographical area covered by a set of nodes into small zones. In mobile network, the clustering mechanism varied due to the mobility of the nodes any time in any direction. That causes the partitioning of the network or the joining of nodes. Several existing centralized or globalized algorithm have … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 7,430 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordA CURE Algorithm for Vietnamese Sentiment Classification in a Parallel EnvironmentVo Ngoc Phu, Vo Thi Ngoc Tran, Jack MaxSolutions to process big data are imperative and beneficial for numerous fields of research and commercial applications. Thus, a new model has been proposed in this paper to be used for big data set sentiment classification in the Cloudera parallel network environment. Clustering Using Representatives (CURE), combined with Hadoop MAP (M) / REDUCE (R) in Cloudera – a parallel network … …Journal of Computer Science, Vol. 15, Issue 10 · 19 Apr 2018 · 7,437 accessesView PDF Cite

InvestigationOpen accessAll words, across the recordA Conceptualization of Distributed Computation for Machine Learning: The Voting AlgorithmTalal Talib JameelThis paper describes a voting algorithm that can be used to find the most optimal solution to clustering problems in machine learning. As part of the family of algorithms known as Condorcet methods, the voting algorithm is used to choose a particular candidate, even in the absence of a definitive majority. The algorithm proceeds in two steps: Renormalization and reconciliation. … …American Journal of Engineering and Applied Sciences, Vol. 10, Issue 1 · 2 Mar 2017 · 7,890 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordAdvanced Energy Efficient Passive Clustering Mobility in Wireless Sensor NetworksAouad Siham, Maach Abdelillah, El Ganami DrissWireless sensor networks have a wide applicability and increase deployment in the near future. In most of those applications, the network is composed of an important number of nodes deployed in an extensive area in which not all nodes are directly connected and based on clustering techniques. The Clustering can considerably reduce transmission overhead during flooding. In fact, by using … …American Journal of Applied Sciences, Vol. 10, Issue 12 · 24 Oct 2013 · 6,756 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordArchitectural Review of Load Balancing Single System ImageB. S. Ahmed, K. Samsudin, A. R. RamliProblem statement: With the growing popularity of clustering application combined with apparent usability, the single system image is in the limelight and actively studied as an alternative solution for computational intensive applications as well as the platform for next evolutionary grid computing era. Approach: Existing researches in this field concentrated on various features of Single System Images like file system … …Journal of Computer Science, Vol. 4, Issue 9 · 30 Sep 2008 · 8,628 accessesView PDF Cite