• No results found

[PDF] Top 20 K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets

Has 10000 "K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets" found on our website. Below are the top 20 most common "K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets".

K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets

K-means algorithm via preprocessing technique and singular value decomposition for high dimension datasets

... There are two important issues in creating a K-means clustering algorithm: the optimal number of clusters and the center of the cluster. In many cases, the number of clusters is given, thus the ... See full document

30

An Enhanced Method for Randomized Dimensionality Reduction Using Roughset Based K-Means Clustering

An Enhanced Method for Randomized Dimensionality Reduction Using Roughset Based K-Means Clustering

... unsupervised datasets using the methodologies namely, preprocessing, k-means based principal component analysis algorithm, Roughset Based Feature Selection and Rough-Set Based K- ... See full document

7

Research on Railway Emergency Rescue Decision Making Method Based on Clustering and SVD Algorithm

Research on Railway Emergency Rescue Decision Making Method Based on Clustering and SVD Algorithm

... Although singular value decomposition can find potential demand in high-dimensional data, the increase of data will lead to low ...of K-means clustering, see ... See full document

6

Singular value decomposition and its applications

Singular value decomposition and its applications

... QR algorithm if we had used it on ...a singular value and work with a matrix of order n n ...QR algorithm with shifts, when applied to symmetric tridiagonal matrices, converge globally with at ... See full document

25

Singular Value Decomposition & Few Application

Singular Value Decomposition & Few Application

... Abstract—Singular Value Decomposition (SVD) is a tool for teaching linear algebra ...methods, Dimension reduction, Low rank data’s storage, Education related problems, Data ... See full document

5

Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing

Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing

... the algorithm on letter bigrams illus- trates different ...entire singular vec- tor pair. Figure 1 shows the third singular vec- tor pair derived by running the algorithm on letter ...left ... See full document

8

Significant Sentence Extraction by Euclidean Distance Based on Singular Value Decomposition

Significant Sentence Extraction by Euclidean Distance Based on Singular Value Decomposition

... In conclusion, the information on the cooccurrence relationships between the terms by the PCA and the vector expressions of the sentences and terms by the SVD can be helpful for the text summarization. Furthermore, the ... See full document

10

A Survey: Privacy Preservation Data Mining Techniques and Geometric Transformation Anjana K. Patel

A Survey: Privacy Preservation Data Mining Techniques and Geometric Transformation Anjana K. Patel

... Perturbation techniques can be used for achieving privacy in data publishing and also in the process of data mining these have certain limitations: i) Since this model uses distributions instead of original records, it ... See full document

6

Structural graph matching using the EM algorithm and singular value decomposition

Structural graph matching using the EM algorithm and singular value decomposition

... The utility measure underpinning the EM algorithm is the conditional expected log likelihood. The basic idea is to identify updated parameters that maximize their expected likelihood conditional upon the ... See full document

18

Semantic search using Latent Semantic 
		Indexing and Word Net

Semantic search using Latent Semantic Indexing and Word Net

... This technique is not entirely reliable, as it does not take into account the conceptual meaning of ...this technique fails to take into account that multiple words may have the same meaning; it focuses ... See full document

5

Multi Functional Antenna Array Assisted MC DS CDMA Using Downlink Preprocessing Based on Singular Value Decomposition

Multi Functional Antenna Array Assisted MC DS CDMA Using Downlink Preprocessing Based on Singular Value Decomposition

... transmitter preprocessing indicated by ‘TP-SVD’, the BER performance is further improved, in comparison with the system using ...transmitter preprocessing requires the knowledge about the downlink ... See full document

5

A REVERSE TRANSMISSION APPROACH 
		FOR MULTI-HOP ROUTING IN WIRELESS SENSOR NETWORK

A REVERSE TRANSMISSION APPROACH FOR MULTI-HOP ROUTING IN WIRELESS SENSOR NETWORK

... on K-means and K-medoids in a grid environment using DOE frame ...the K-means algorithm overcomes the problem of clustering larger datasets by using the grid environment ... See full document

8

Title : Satellite Image Enhancement using Fast Discrete Curvelet TransformAuthor (s) :Mohammed Abdulwahhab Ahmed, E. Sreenivasa Reddy

Title : Satellite Image Enhancement using Fast Discrete Curvelet TransformAuthor (s) :Mohammed Abdulwahhab Ahmed, E. Sreenivasa Reddy

... pixel value in the interior and surrounding regions that must be exceeded for the pixel to be retained, to produce the resulting Filtered Image shown on the ... See full document

5

A Hybrid Video Watermarking Technique based on DWT, SVD and SCHUR Decomposition

A Hybrid Video Watermarking Technique based on DWT, SVD and SCHUR Decomposition

... In this paper a hybrid transformation technique and visual attention region determination schemes are used in video watermarking. The detection of visual attention region helps to persist various attacks and ... See full document

9

Design & Analysis of Purchasing Behaviour of Customers in Supermarkets using TRFM Model of Data Mining

Design & Analysis of Purchasing Behaviour of Customers in Supermarkets using TRFM Model of Data Mining

... RFM analysis differentiate important consumers from huge database by three parameters as interval of recency, frequency and monetary. But how much time taken by customer to purchase the products in supermarket is not ... See full document

8

DETECTION OF CHANGES OF THE SYSTEM TECHNICAL STATE USING STOCHASTIC SUBSPACE OBSERVATION METHOD

DETECTION OF CHANGES OF THE SYSTEM TECHNICAL STATE USING STOCHASTIC SUBSPACE OBSERVATION METHOD

... The presented example of a non-parametric diagnostics method of the IC engine valve sys- tem, on the basis of data subspace, belongs to al- gorithms of filtration realised according to statis- tic properties. Original ... See full document

5

DWT-DCT-SVD BASED DIGITAL IMAGE WATERMARKING USINGSALT AND PEPPER METHOD

DWT-DCT-SVD BASED DIGITAL IMAGE WATERMARKING USINGSALT AND PEPPER METHOD

... Watermarking technique is now day wants to provide new vigorous for any image and also benign from many type of ...of Singular Value Decomposition and Discrete Cosine Transformation ... See full document

5

Jaccard with Singular Value Decomposition Hybrid Recommendation Algorithm

Jaccard with Singular Value Decomposition Hybrid Recommendation Algorithm

... recommendation algorithm is studied, and a combination of Jaccard and singular value decomposition algorithm is proposed to improve the recommendation accuracy and recall ...Jaccard ... See full document

7

Utility of the K Means Clustering Algorithm in Differentiating Apparent Diffusion Coefficient Values of Benign and Malignant Neck Pathologies

Utility of the K Means Clustering Algorithm in Differentiating Apparent Diffusion Coefficient Values of Benign and Malignant Neck Pathologies

... Although this study was performed on a small number of patients, these results suggest that the differences in ADC val- ues between benign and malignant neck pathologies may not be truly represented by measurement of ... See full document

5

A non-parametric approach to population structure inference using multilocus genotypes

A non-parametric approach to population structure inference using multilocus genotypes

... Our strategy does not rely on any population genetic assumptions, such as Hardy–Weinberg equilibrium and linkage equilibrium between loci within populations. This means that violation of the assumptions does not ... See full document

12

Show all 10000 documents...