Using a Matrix Decomposition for Clustering Data

2009 ◽  
Author(s):  
Hussam Dahwa Abdulla ◽  
Martin Polovincak ◽  
Václav Snasel
Keyword(s):  
Matrix Decomposition ◽  
Clustering Data

Penerapan Data Mining Untuk Prediksi Penjualan Mobil Menggunakan Metode K-Means Clustering

2020 ◽  
Vol 3 (3) ◽  
pp. 187-201
Author(s):  
Sufajar Butsianto ◽  
Nindi Tya Mayangwulan
Keyword(s):  
Data Mining ◽  
Clustering Data ◽  
Cluster 2

Penggunaan mobil di Indonesia setiap tahunnya selalu meningkat dan membuat perusahaan otomotif berlomba-lomba dalam peningkatan penjualannya. Tujuan dari penelitian ini untuk mengelompokan data penjualan kedalam sebuah cluster dengan metode Data Mining Algoritma K-Means Clustering. Data Penjualan nantinya akan dikelompokan berdasarkan kemiripan data tersebut sehingga data dengan karakteristik yang sama akan berada dalam satu cluster. Atribut yang digunakan adalah brand dan penjualan. Cluster yang terbentuk setelah dilakukan proses K-Means Clustering terbagi menjadi tiga cluster yaitu Cluster 0 jumlah anggota 235 dengan presentase 26% dikategorikan Laris, Cluster 1 jumlah anggota 604 dengan presentase 67% dikategorikan Kurang Laris, dan Cluster 2 jumlah angota 61 dengan presentase 7% dikategorikan Paling Laris, dari proses clustering diatas dapat diperoleh validasi DBI (Davies Bouldin Index) dengan nilai 0,341

K-MEANS CLUSTERING ALGORITHM FOR SERVICE DATA ANALYSIS BASED ON CUSTOMERS COMBINATION

2018 ◽  
Vol 3 (1) ◽  
pp. 001
Author(s):  
Zulhendra Zulhendra ◽  
Gunadi Widi Nurcahyo ◽  
Julius Santony
Keyword(s):  
Data Mining ◽  
Data Analysis ◽  
Clustering Algorithm ◽  
Customer Complaints ◽  
Using Data ◽  
Clustering Data ◽  
Service Data ◽  
Selection Of

In this study using Data Mining, namely K-Means Clustering. Data Mining can be used in searching for a large enough data analysis that aims to enable Indocomputer to know and classify service data based on customer complaints using Weka Software. In this study using the algorithm K-Means Clustering to predict or classify complaints about hardware damage on Payakumbuh Indocomputer. And can find out the data of Laptop brands most do service on Indocomputer Payakumbuh as one of the recommendations to consumers for the selection of Laptops.

IMPLEMENTASI DATA MINING UNTUK MENENTUKAN TINGKAT PENJUALAN PAKET DATA TELKOMSEL MENGGUNAKAN METODE K-MEANS CLUSTERING

2020 ◽  
Vol 25 (1) ◽  
pp. 76-88
Author(s):  
Suhandio Handoko ◽  
Fauziah Fauziah ◽  
Endah Tri Esti Handayani
Keyword(s):  
Data Mining ◽  
Clustering Data

Perkembangan industri telekomunikasi saat ini sangat pesat karena telekomunikasi sudah menjadi kebutuhan utama bagi masyarakat sehingga banyak perusahaan yang bergerak di industry telekomunikasi. Banyaknya industry Telekomunikasi menuntut para pengembang untuk menemukan strategi atau suatu pola yang dapat meningkatkan penjualan dan pemasaran produk, salah satu strateginya adalah dengan memanfaatkan data transaksi. Paket data merupakan produk dibidang telekomunikasi. Proses Clustering saat ini masih di lakukan secara manual sehingga membutuhkan waktu, proses perhitungan dan ketelitian yang tinggi. Pada penelitian ini dibuat aplikasi berbasis website dengan tujuan untuk mempermudah Clustering data sehingga dapat digunakan sebagai referensi dalam perencanaan promosi produk telkomsel ke berbagai daerah. Metode yang digunakan untuk mengatasi permasalahan tersebut yaitu metode Clustering dengan menggunakan Algoritma K-Means. Algoritma K-Means merupakan algoritma pengelompokkan sejumlah data menjadi menjadi kelompok-kelompok data tertentu. Pada penelitian ini data penjualan dikelompokkan menjadi 3 yaitu data penjualan rendah, data penjualan sedang dan data penjualan tinggi. Pengujian clustering dengan algoritma K-Means pada aplikasi terhadap data transaksi penjualan paket telkomsel diperoleh persentase kesesuaian yaitu 100% dibandingkan dengan clustering manual.

A Survey of Network Embedding for Drug Analysis and Prediction

2020 ◽  
Vol 21 ◽  
Author(s):  
Zhixian Liu ◽  
Qingfeng Chen ◽  
Wei Lan ◽  
Jiahai Liang ◽  
Yiping Pheobe Chen ◽  
...  
Keyword(s):  
Deep Learning ◽  
Protein Function ◽  
Dimensional Space ◽  
Auxiliary Information ◽  
Matrix Decomposition ◽  
Drug Analysis ◽  
Machine Learning Algorithms ◽  
Superior Performance ◽  
Network Embedding ◽  
Similarity Estimation

: Traditional network-based computational methods have shown good results in drug analysis and prediction. However, these methods are time consuming and lack universality, and it is difficult to exploit the auxiliary information of nodes and edges. Network embedding provides a promising way for alleviating the above problems by transforming network into a low-dimensional space while preserving network structure and auxiliary information. This thus facilitates the application of machine learning algorithms for subsequent processing. Network embedding has been introduced into drug analysis and prediction in the last few years, and has shown superior performance over traditional methods. However, there is no systematic review of this issue. This article offers a comprehensive survey of the primary network embedding methods and their applications in drug analysis and prediction. The network embedding technologies applied in homogeneous network and heterogeneous network are investigated and compared, including matrix decomposition, random walk, and deep learning. Especially, the Graph neural network (GNN) methods in deep learning are highlighted. Further, the applications of network embedding in drug similarity estimation, drug-target interaction prediction, adverse drug reactions prediction, protein function and therapeutic peptides prediction are discussed. Several future potential research directions are also discussed.

scholarly journals Customized depolarization spatial patterns with dynamic retardance functions

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
David Marco ◽  
Guadalupe López-Morales ◽  
María del Mar Sánchez-López ◽  
Ángel Lizana ◽  
Ignacio Moreno ◽  
...  
Keyword(s):  
Spatial Patterns ◽  
Detection System ◽  
Temporal Integration ◽  
Matrix Decomposition ◽  
Decomposition Methods ◽  
Time Dependent ◽  
Light Modulator ◽  
Dynamical Time ◽  
Depolarization Effect ◽  
Spatially Variant

AbstractIn this work we demonstrate customized depolarization spatial patterns by imaging a dynamical time-dependent pixelated retarder. A proof-of-concept of the proposed method is presented, where a liquid–crystal spatial light modulator is used as a spatial retarder that emulates a controlled spatially variant depolarizing sample by addressing a time-dependent phase pattern. We apply an imaging Mueller polarimetric system based on a polarization camera to verify the effective depolarization effect. Experimental validation is provided by temporal integration on the detection system. The effective depolarizance results are fully described within a simple graphical approach which agrees with standard Mueller matrix decomposition methods. The potential of the method is discussed by means of three practical cases, which include non-reported depolarization spatial patterns, including exotic structures as a spirally shaped depolarization pattern.

scholarly journals A General Framework for Mixed and Incomplete Data Clustering Based on Swarm Intelligence Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 786
Author(s):  
Yenny Villuendas-Rey ◽  
Eley Barroso-Cubas ◽  
Oscar Camacho-Nieto ◽  
Cornelio Yáñez-Márquez
Keyword(s):  
Swarm Intelligence ◽  
Data Clustering ◽  
Incomplete Data ◽  
Missing Values ◽  
Clustering Algorithms ◽  
Bat Algorithm ◽  
Hybrid Features ◽  
Bee Colony ◽  
Learning Tasks ◽  
Clustering Data

Swarm intelligence has appeared as an active field for solving numerous machine-learning tasks. In this paper, we address the problem of clustering data with missing values, where the patterns are described by mixed (or hybrid) features. We introduce a generic modification to three swarm intelligence algorithms (Artificial Bee Colony, Firefly Algorithm, and Novel Bat Algorithm). We experimentally obtain the adequate values of the parameters for these three modified algorithms, with the purpose of applying them in the clustering task. We also provide an unbiased comparison among several metaheuristics based clustering algorithms, concluding that the clusters obtained by our proposals are highly representative of the “natural structure” of data.

Small matrix modular path integral: iterative quantum dynamics in space and time

2021 ◽  
Author(s):  
Nancy Makri
Keyword(s):  
Path Integral ◽  
Quantum Dynamics ◽  
Matrix Decomposition ◽  
Propagation Time ◽  
Molecular Aggregates ◽  
Space And Time ◽  
Small Matrix

This work presents a small matrix decomposition of the modular path integral for spin arrays or molecular aggregates, which leads to an iterative treatment with respect to the units that comprise the system and the propagation time.

Sign in / Sign up

Export Citation Format

Share Document