• No results found

[PDF] Top 20 Non-Redundant Overlapping Clustering: Algorithms and Applications

Has 10000 "Non-Redundant Overlapping Clustering: Algorithms and Applications" found on our website. Below are the top 20 most common "Non-Redundant Overlapping Clustering: Algorithms and Applications".

Non-Redundant Overlapping Clustering: Algorithms and Applications

Non-Redundant Overlapping Clustering: Algorithms and Applications

... four algorithms on two synthetic ...these overlapping columns are at the end of the first bicluster and at the beginning of the second ...different overlapping biclusters through the ex- pansion ... See full document

157

A Technical Insight into Clustering Algorithms & Applications

A Technical Insight into Clustering Algorithms & Applications

... at a tremendous rate. Cluster analysis divides data into groups for the purposes of summarization or improved understanding to assist in decision making. Researchers in data mining and machine learning faces challenges ... See full document

5

On Clustering Algorithms: Applications in Word-Embedding Documents

On Clustering Algorithms: Applications in Word-Embedding Documents

... Spectral Clustering. [4] creates a graph with the points in which each point is a vertex and the similarity of the points are weighted edges. It then computes the Laplacian of the adjacency matrix and then ... See full document

5

Computational Intelligence for Wireless Sensor Networks: Applications and Clustering Algorithms

Computational Intelligence for Wireless Sensor Networks: Applications and Clustering Algorithms

... is the number of nodes in the cluster j. Authors applied the PSO algorithm while varying inertia weight, or the acceleration constant. Analysis of the results are discussed in details in [49],[48]. In [29], authors ... See full document

8

Fuzzy clustering algorithms and their applications to chemical datasets

Fuzzy clustering algorithms and their applications to chemical datasets

... The fuzzy based clustering methods had shown tremendous achievements in areas of image processing and pattern recognition. The fuzzy c- mean is a good choice for circular or spherical clusters. But if the ... See full document

5

Algorithms and Data Structures With Applications to Graphics and Geometry - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials

Algorithms and Data Structures With Applications to Graphics and Geometry - Free Computer, Programming, Mathematics, Technical Books, Lecture Notes and Tutorials

... There is no one answer, there are many! Consider the analogy of the mathematical concept of real numbers, defined by axioms. When we approximate real numbers on a computer, we have a choice of many different number ... See full document

371

Some Improvements of Fuzzy Clustering Algorithms Using Picture Fuzzy Sets and Applications For Geographic Data Clustering

Some Improvements of Fuzzy Clustering Algorithms Using Picture Fuzzy Sets and Applications For Geographic Data Clustering

... fuzzy clustering to handle geographic data (see the review in [5, 11, ...data clustering, in which there are some researches in the direction of clustering geographical ...fuzzy clustering of ... See full document

7

Algorithms for Clustering on the Sphere: Advances & Applications

Algorithms for Clustering on the Sphere: Advances & Applications

... Generative (parametric) approaches such as multivariate mixture models provide methods that have distinct advan- tages over competing non-probabilistic approaches for cer- tain problems. Generative approaches ... See full document

6

Applications of Clustering Algorithms in Academic Performance Evaluation

Applications of Clustering Algorithms in Academic Performance Evaluation

... C-Means clustering algorithms to student allocation problem that allocates new students to homogenous groups of specified maxi- mum capacity, and analyze effects of such allocations on the academic ... See full document

14

Overlapping Community detection Algorithms: A Review

Overlapping Community detection Algorithms: A Review

... “Detecting overlapping communities of weighted networks via a local algorithm,” Physica A: Statistical Mechanics and its Applications, ...with overlapping communities, EPL (Europhysics Letters)”, ... See full document

7

Efficient Algorithm to Find Information Rich Subset in High Dimensional Data

Efficient Algorithm to Find Information Rich Subset in High Dimensional Data

... Abstract-- Clustering in High Dimensional Data is the cluster analysis of data with anywhere from a few dozens to many thousands of ...the clustering of text documents where if a word-frequency vector is ... See full document

5

Improving Density based Clustering using Metric Optimization

Improving Density based Clustering using Metric Optimization

... earlier, clustering is analyzing the data into groups of related ...data clustering that differ in their complexity and influence, due to the huge number of applications that the algorithms ... See full document

8

Static and incremental overlapping clustering algorithms for large collections processing in GPU

Static and incremental overlapping clustering algorithms for large collections processing in GPU

... the clustering algorithms developed so far do not consider that clusters could share elements; however, the desire of ade- quately target those applications dealing with this problem, have recently ... See full document

16

Ensemble based Distributed K-Modes Clustering

Ensemble based Distributed K-Modes Clustering

... data clustering algorithms is to cluster the distributed datasets without gathering all the data to a single ...data clustering is to achieve a global clustering that is as good as the best ... See full document

11

Clustering for High Dimensional Data: Density based Subspace Clustering Algorithms

Clustering for High Dimensional Data: Density based Subspace Clustering Algorithms

... CLIQUE [3] is the first grid based, non-overlapping, axis parallel subspace clustering algorithm. It uses an apriori-like method which recursively navigates through the set of possible subspaces in a ... See full document

7

Decomposing non-redundant sharing by complementation

Decomposing non-redundant sharing by complementation

... We have addressed the problem of deriving a non-trivial decomposition for ab- stract domains tracking groundness and sharing information for logic languages by means of complementation. To this end, we have ... See full document

30

Community Overlapping Detection using Social Media Dataset and Redundant Node Elimination

Community Overlapping Detection using Social Media Dataset and Redundant Node Elimination

... Fortunato, S et.al. proposed a small value of k also known as threshold value provide base for detection of overlapping community. Complexity of the network greatly depends upon the factor that graph is strongly ... See full document

6

A Comparative Study of clustering algorithms
Using weka tools

A Comparative Study of clustering algorithms Using weka tools

... Data clustering is a process of putting similar data into groups. A clustering algorithm partitions a data set into several groups based on the principle of maximizing the intra-class similarity and ... See full document

5

Clustering Algorithms for Chains

Clustering Algorithms for Chains

... Previous research on cluster analysis in general is too numerous to be covered here in full. Instead, we refer the readers to recent surveys by Xu and Wunsch (2005) and Berkhin (2006). For the problem of ... See full document

35

Fuzzy Clustering Algorithms

Fuzzy Clustering Algorithms

... de clustering o agrupamiento es el algoritmo Fuzzy C-Means (FCM), es una técnica difusa de minería de datos para el clustering que se basa en el algoritmo clásico ... See full document

14

Show all 10000 documents...

Related subjects