Computer Engineering Commons^™

Clustering Method Based On Graph Data Model And Reliability Detection, Yanyun Cheng, Huisong Bian, Changsheng Bian

Journal of System Simulation

Abstract: For the data in feature space, traditional clustering algorithm can take clustering analysis directly. High-dimensional spatial data cannot achieve intuitive and effective graphical visualization of clustering results in 2D plane. Graph data can clearly reflect the similarity relationship between objects. According to the distance of the data objects, the feature space data are modeled as graph data by iteration. Cluster analysis based on modularity is carried out on the modeling graph data. The two-dimensional visualization of non-spherical-shape distribution data cluster and result is achieved. The concept of credibility of the clustering result is proposed, and a method is proposed, …

K-Means: A Revisit, Wan-Lei Zhao, Cheng-Hao Deng, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Due to its simplicity and versatility, k-means remains popular since it was proposed three decades ago. The performance of k-means has been enhanced from different perspectives over the years. Unfortunately, a good trade-off between quality and efficiency is hardly reached. In this paper, a novel k-means variant is presented. Different from most of k-means variants, the clustering procedure is driven by an explicit objective function, which is feasible for the whole l(2)-space. The classic egg-chicken loop in k-means has been simplified to a pure stochastic optimization procedure. The procedure of k-means becomes simpler and converges to a considerably better local …

Interactive Clinical Event Pattern Mining And Visualization Using Insurance Claims Data, Zhenhui Piao

Theses and Dissertations--Computer Science

With exponential growth on a daily basis, there is potentially valuable information hidden in complex electronic medical records (EMR) systems. In this thesis, several efficient data mining algorithms were explored to discover hidden knowledge in insurance claims data. The first aim was to cluster three levels of information overload(IO) groups among chronic rheumatic disease (CRD) patient groups based on their clinical events extracted from insurance claims data. The second aim was to discover hidden patterns using three renowned pattern mining algorithms: Apriori, frequent pattern growth(FP-Growth), and sequential pattern discovery using equivalence classes(SPADE). The SPADE algorithm was found to be the …

Retail Data Analytics Using Graph Database, Rashmi Priya

Theses and Dissertations--Computer Science

Big data is an area focused on storing, processing and visualizing huge amount of data. Today data is growing faster than ever before. We need to find the right tools and applications and build an environment that can help us to obtain valuable insights from the data. Retail is one of the domains that collects huge amount of transaction data everyday. Retailers need to understand their customer’s purchasing pattern and behavior in order to take better business decisions.

Market basket analysis is a field in data mining, that is focused on discovering patterns in retail’s transaction data. Our goal is …

Machine Learning Techniques Implementation In Power Optimization, Data Processing, And Bio-Medical Applications, Khalid Khairullah Mezied Al-Jabery

Doctoral Dissertations

"The rapid progress and development in machine-learning algorithms becomes a key factor in determining the future of humanity. These algorithms and techniques were utilized to solve a wide spectrum of problems extended from data mining and knowledge discovery to unsupervised learning and optimization. This dissertation consists of two study areas. The first area investigates the use of reinforcement learning and adaptive critic design algorithms in the field of power grid control. The second area in this dissertation, consisting of three papers, focuses on developing and applying clustering algorithms on biomedical data. The first paper presents a novel modelling approach for …

Composite Vector Quantization For Optimizing Antenna Locations, Zekeri̇ya Uykan, Riku Jantti

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we study the location optimization problem of remote antenna units (RAUs) in generalized distributed antenna systems (GDASs). We propose a composite vector quantization (CVQ) algorithm that consists of unsupervised and supervised terms for RAU location optimization. We show that the CVQ can be used i) to minimize an \textit{upper bound} to the cell-averaged SNR error for a desired/demanded location-specific SNR function, and ii) to maximize the cell-averaged \textit{effective} \textit{SNR}. The CVQ-DAS includes the standard VQ, and thus the well-known squared distance criterion (SDC) as a special case. Computer simulations confirm the findings and suggest that the proposed …