PosterPDF Available

Project Introduction and Dynamic-Time-Warping Cluster Analysis of SPEI Time Series

June 2022

Conference: MOSES - Stakeholder-Workshop 2022

Authors:

Isabella Smekal

Nordwestdeutsche Forstliche Versuchsanstalt

Alexander Ney

Nordwestdeutsche Forstliche Versuchsanstalt

Content uploaded by Isabella Smekal

Content may be subject to copyright.

A preview of the PDF is not available

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Recent trends in hierarchic document clustering: A critical review

January 1988 · Information Processing & Management

Peter Willett

This article reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. After an introduction to the calculation of interdocument similarities and to clustering methods that are appropriate for document clustering, the article discusses algorithms that can be used to allow the implementation of these methods on databases of nontrivial size. The ... [Show full abstract] validation of document hierarchies is described using tests based on the theory of random graphs and on empirical characteristics of document collections that are to be clustered. A range of search strategies is available for retrieval from document hierarchies and the results are presented of a series of research projects that have used these strategies to search the clusters resulting from several different types of hierarchic agglomerative clustering method. It is suggested that the complete linkage method is probably the most effective method in terms of retrieval performance; however, it is also difficult to implement in an efficient manner. Other applications of document clustering techniques are discussed briefly; experimental evidence suggests that nearest neighbor clusters, possibly represented as a network model, provide a reasonably efficient and effective means of including interdocument similarity information in document retrieval systems.

Article

Full-text available

A Review of Nonnegative Matrix Factorization Methods for Clustering

July 2015

Ali Caner Turkmen

Nonnegative Matrix Factorization (NMF) was first introduced as a low-rank matrix approximation technique, and has enjoyed a wide area of applications. Although NMF does not seem related to the clustering problem at first, it was shown that they are closely linked. In this report, we provide a gentle introduction to clustering and NMF before reviewing the theoretical relationship between them. We ... [Show full abstract] then explore several NMF variants, namely Sparse NMF, Projective NMF, Nonnegative Spectral Clustering and Cluster-NMF, along with their clustering interpretations.

View full-text

Article

Recent Trends in Hierarchic Document Clustering: A Critical Review

December 1988 · Information Processing & Management

Peter Willett

Article

Classifying Elizabethan Prose Styles with Cluster Analysis

January 1988

Norbert BOLZ

This paper reports a research project in progress at Cologne university dealing \Vith euphuism in Elizabethan prose. The project is carried out in two phases: Phase onc, which is now completed, was ta show whether duster analysis is applicable ta a classification of these prose styles or not and whether it has auy marked advantages. Phase two will try ta arrive at a quantitative description of ... [Show full abstract] euphuism. The main emphasis in this report will he on one of the tools userl ta classify texts on a quantitative basis, namely c1uster analysis. The paper is divided iuta three parts: 1. Introduction ta euphuism and the literary background. 2. Cluster analysis and sorne reasons for using it. 3. Results and demonstration of sorne of the features of cluster analysis.

Article

Identifying Distinctive Subsequences in Multivariate Time Series by Clustering

October 1999

Tim Oates

Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a different problem, determining what distinguishes time series in that set from other time series obtained from the same source. In both cases the goal is to identify shared patterns, though in the latter case those patterns must be distinctive as well. An efficient ... [Show full abstract] incremental algorithm for identifying distinctive subsequences in multivariate, real-valued time series is described and evaluated with data from two very different sources: the response of a set of bandpass filters to human speech and the sensors of a mobile robot. Reference Number: 357 ** DRAFT - do not distribute ** 2 1 Introduction Given two or more sequences of discrete tokens, a dynamic programming algorithm exists for finding the longest common subsequence they share (Cormen, Leiserson, & Rivest 1990). This basic algorithm has been adapted in various ways to find patterns shared by re...