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 20 of 29 for “"Cluster analysis--Data processing"”.
-
Co-clustering algorithms : extensions and applications
Co-clustering is rather a recent paradigm for unsupervised data analysis, but it has become increasingly popular because of its potential to discover latent local patterns, otherwise unapparent by usual unsupervised algorithms such as k-means. Wide deployment of co-clustering, however, requires …
-
Robust methods for locating multiple dense regions in complex datasets
In classical clustering, each data point is assigned to at least one cluster. However, in many real-world problems, only a small subset of the data clusters well, while the rest shows little or no clustering tendencies. For such situations, this thesis presents several techniques that cluster only …
-
A computer system load model based on cluster analysis
Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1973
-
Data clustering with pairwise constraints
The classical unsupervised clustering is an ill-posed problem due to the absence of a unique clustering criteria. This issue can be addressed by introducing additional supervised information, usually casts in the form of pairwise constraints, to the clustering procedure. Depending on the sources, …
-
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 …
-
Learnable similarity functions and their application to record linkage and clustering
Many machine learning and data mining tasks depend on functions that estimate similarity between instances. Similarity computations are particularly important in clustering and information integration applications, where pairwise distances play a central role in many algorithms. Typically, …
-
Clustering in relational data and ontologies
This dissertation studies the problem of clustering objects represented by relational data. This is a pertinent problem as many real-world data sets can only be represented by relational data for which object-based clustering algorithms are not designed. Relational data are encountered in many …
-
Partitioning of prosodic features for audio similarity comparison
… clips and receive matches. The audio requires processing before being input to the system which is comprised of multiple steps. Existing methodologies using classifier systems requiring classifier training are discussed and deemed unsuitable for this application. The partitioning of extracted …
-
Alternative Clustering Algorithms in Sensor Networks
… large fields, and the like, and can transmit data to a Base station (BS). In a clusterbased network organization, sensor nodes are organized into clusters and one sensor node is selected as a sensor head (SH) in each cluster. Each SH denotes a facility and sends useful information to the Base …
-
An extendable general platform for cluster analysis and validation
… platform which integrates several commonly used cluster analysis algorithms with ease of use and extendability, along with various validation techniques to analyze the results of algorithms.
-
An extendable general platform for cluster analysis and validation
… platform which integrates several commonly used cluster analysis algorithms with ease of use and extendability, along with various validation techniques to analyze the results of algorithms.
-
Integrated application for use in welding data analysis, An
Includes bibliographical references (pages 144-145).
-
Extending low-rank matrix factorizations for emerging applications
… increasingly popular to project high dimensional data into latent spaces with small dimensions in order to obtain better understandings of the data and thus more accurate predictions. In particular, they have been widely applied to important applications such as collaborative filtering and social …
-
Sharing the love : a generic socket API for Hadoop Mapreduce
… software framework written in Java that performs data-intensive distributed computations on a cluster. It includes Hadoop MapReduce and the Hadoop Distributed File System (HDFS). HDFS has known scalability limitations due to its single NameNode which holds the entire file system namespace in RAM …
-
Text mining of online book reviews for non-trivial clustering of books and users
… in scope due having limited access to user data. Many of these studies used human domain knowledge to evaluate the accuracy of features extracted using these methods. In this thesis, we mine book review text to identify nontrivial features of a set of similar books. We make comparisons …
-
Semantic Frameworks for Document and Ontology Clustering
… efficient ways to identify related publications. Clustering, a technique used in many fields, is one way to facilitate this. Ontologies can also help in addressing the problem of finding related entities, including research publications. However, the development of new methods of clustering has …
Page 1 of 2