Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"Cluster analysis--Computer programs"”.
-
Probabilistic model-based clustering of complex data
… emerging data mining applications, one needs to cluster complex data such as very high-dimensional sparse text documents and continuous or dis- crete time sequences. Probabilistic model-based clustering techniques have shown promising results in many such applications. For real-valued …
-
Self-organizing maps-based temporal cluster analysis
Discovering clustering changes in real-life datasets is important in many contexts, such as fraud detection and customer attrition analysis. Organizations can use such knowledge of change to adapt business strategies in response to changing circumstances. To understand what has changed, analysts …
-
Development of an adaptive fuzzy shell clustering algorithm and validity measures
<p>In objective functional based fuzzy clustering algorithms the weighted sum of the distances of the feature vectors from cluster prototype are minimized. The fuzzy memberships are utilized as weighing factors. The cluster prototype can be a point or a line or a plane, etc. This work extends the …
-
Hierarchical stability based model selection for clustering algorithms.
… HS-means, which is able to learn the number of clusters in a mixture model based on the hierarchical analysis of clustering stability. Our method extends the concept of clustering stability to a concept of hierarchical stability. The method estimates a stable model for the data based on analysis …
-
Automatic text summarization using lexical chains : algorithms and experiments
… texts of a document collection into meaningful clusters. clustering enable us to extract the various themes of the document collection. Sentences from clusters can then be extracted to generate a summary for the multi-document collection. Clusters can also be used to generate summaries with …
-
Clustering algorithms to further enhance predictable situational data in vehicular ad-hoc networks
… idea, invention, or threat emerges. With modern computer software and hardware advancements, we have the emergence of more internet-enabled devices - or, Internet of Things (IoT) devices. We can now create large networks with any device to gather real-time information about an environment. In …
-
Automatic text summarization in digital libraries
… being the slowest at 0.9 MV/hr. Qualitative analysis on four genres: newspaper, M.Sc. thesis, novel, and poetry, revealed narrative newspapers were most suitable for automatically generated summarization. The other genres suffered from incoherence and information loss. Overall, summaries for …
-
Personalized information discovery from unstructured text
… D.)--Michigan State University. Department of Computer Science, 1998
-
An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm
… literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.
-
An efficient algorithm to solve high-dimensional data clustering: Candidate subspace clustering algorithm
… literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.
-
Robust clustering algorithms
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across any different fields ranging from computational biology to social sciences to computer vision in part because they are simple and their output is easy to interpret. …
-
Approximation algorithms for a graph-cut problem with applications to a clustering problem in bioinformatics
Clusters in protein interaction networks can potentially help identify functional relationships among proteins. We study the clustering problem by modeling it as graph cut problems. Given an edge weighted graph, the goal is to partition the graph into a prescribed number of subsets obeying some …
-
Cluster Analysis of Landsat Data
Not Available.
-
A Robust Data Obfuscation Technique for Privacy Preserving Collaborative Filtering
… DO techniques, (b) the development of a robust cluster preserving data obfuscation algorithm, and (c) the design and implementation of a privacy-preserving shared collaborative filtering framework using the data obfuscation algorithm.
-
Domain-Constrained Clustering: A Two-Stage Framework for Muscle Fiber Type Identification
This dissertation introduces a novel Two-Stage Clustering Framework for the automated identification of human skeletal muscle fiber types using fluorescence microscopy image intensity data. By integrating two complementary clustering methods, this framework overcomes the subjectivity and …
-
Interpreting and integrating landsat remote sensing image and geographic information system by fuzzy unsupervised clustering algorithm
… presents a two-pass-mode fuzzy unsupervised clustering algorithm.</p><p>In the first passing, the cluster mean vectors which represent the geographic attributes or the land cover types are derived. In the second passing, the concept of fuzzy set is used. The cluster mean vectors which are …
-
Detection of sleep and wake substates through unsupervised machine learning in rat hippocampus and primary motor cortex LFP recordings
… in the effects of procedural learning, and clustering validity indices effectiveness. Previously obtained local field potential recordings of M1 and the hippocampus of freely-behaving male rats under naïve and task conditions, including transcranial direct and alternating current stimulation …
-
An improved unsupervised modeling methodology for detecting fraud in vendor payment transactions
… transactions through Unsupervised Modeling (cluster analysis). Clementine Data Mining software is used to construct unsupervised models of vendor payment data using the K-Means, Two Step, and Kohonen algorithms. Cluster validation techniques are applied to select the most useful model of each …
-
Solving the maximum clique problems on a class of network graphs, with applications to social networks
Social network analysis frequently uses the idea of a clique in a network to identify key subgroups of highly-connected members of the network. We formulate the maximum clique problem on undirected graphs and develop two algorithms to solve it: a pruning algorithm and an enumeration algorithm. The …