Search results for " Clustering"

Project Management Information Systems (PMISs): A Statistical-Based Analysis for the Evaluation of Software Packages Features

2021

Project Managers (PMs) working in competitive markets are finding Project Management Information Systems (PMISs) useful for planning, organizing and controlling projects of varying complexity. A wide variety of PMIS software is available, suitable for projects differing in scope and user needs. This paper identifies the most useful features found in PMISs. An extensive literature review and analysis of commercial software is made to identify the main features of PMISs. Afterwards, the list is reduced by a panel of project management experts, and a statistical analysis is performed on data acquired by means of two different surveys. The relative importance of listed features is properly comp…

A Greedy Algorithm for Hierarchical Complete Linkage Clustering

2014

We are interested in the greedy method to compute an hierarchical complete linkage clustering. There are two known methods for this problem, one having a running time of \({\mathcal O}(n^3)\) with a space requirement of \({\mathcal O}(n)\) and one having a running time of \({\mathcal O}(n^2 \log n)\) with a space requirement of Θ(n 2), where n is the number of points to be clustered. Both methods are not capable to handle large point sets. In this paper, we give an algorithm with a space requirement of \({\mathcal O}(n)\) which is able to cluster one million points in a day on current commodity hardware.

Balanced Words Having Simple Burrows-Wheeler Transform

2009

The investigation of the "clustering effect" of the Burrows-Wheeler transform (BWT) leads to study the words having simple BWT , i.e. words w over an ordered alphabet $A=\{a_1,a_2,\ldots,a_k\}$, with $a_1 < a_2 < \ldots <a_k$, such that $bwt(w)$ is of the form $a_k^{n_k} a_{k-1}^{n_{k-1}} \cdots a_1^{n_1}$, for some non-negative integers $n_1, n_2, \ldots, n_k$. We remark that, in the case of binary alphabets, there is an equivalence between words having simple BWT, the family of (circular) balanced words and the conjugates of standard words. In the case of alphabets of size greater than two, there is no more equivalence between these notions. As a main result of this paper we prove that, u…

V11. Functional hierarchy within an overall network for visual motion processing and ocular-motor control at rest

2015

Introduction Visual motion processing on one hand and ocular motor functions on the other are rarely studied together in vivo in humans. The interrelation of these functional networks is rather unclear, even though their functional dependence seems obvious. In several fMRI studies the essential nodes of both networks could be localized using voluntary optokinetic ('look') nystagmus (OKN) in the horizontal plane incorporating visual motion tracking (Dieterich et al., 2009). Here, functional connectivity (FC) between these nodes representing both networks was studies using resting-state FC. Methods Resting-state fMRI data of 200 healthy adults (age 44.1±17.9; 79 male) were included in the cro…

Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs

2019

In this article we deal with problems that involve the analysis of topology in graphs modeling biological networks. In particular, we consider two important problems: (i) Network clustering, aiming at finding compact subgraphs inside the input graph in order to isolate molecular complexes, and (ii) searching for motifs, i.e., sub-structures repeated in the input network and presenting high significance (e.g., in terms of their frequency). We provide a compact overview of the main techniques proposed in the literature to solve these problems.

Compaction of Open-Graded HMAs Evaluated by a Fuzzy Clustering Technique

2015

The aim of this paper is the proposal of an expeditious procedure to be used during the execution of an asphalt layer for improving the compaction task. This procedure, based on a fuzzy clustering technique, starts from the knowledge of some information recorded by ordinary measuring instruments and provides an aid to the decision-maker on the number of roller passes needed to achieve a specific density at a certain temperature. This result can be deduced with great rapidity during the paving operations on site without waiting for the time spent in the core extraction and in the subsequent laboratory analysis. In this way it is possible to identify more precisely which aspects of the execut…

Complex Networked Systems: Convergence Analysis, Dynamic Behaviour, and Security.

Complex networked systems are a modern reference framework through which very dierent systems from far disciplines, such as biology, computer science, physics, social science, and engineering, can be described. They arise in the great majority of modern technological applications. Examples of real complex networked systems include embedded systems, biological networks, large-scale systems such as power generation grids, transportation networks, water distribution systems, and social network. In the recent years, scientists and engineers have developed a variety of techniques, approaches, and models to better understand and predict the behaviour of these systems, even though several research…

Cluster-based RF fingerprint positioning using LTE and WLAN signal strengths

2017

Wireless Local Area Network (WLAN) positioning has become a popular localization system due to its low-cost installation and widespread availability of WLAN access points. Traditional grid-based radio frequency (RF) fingerprinting (GRFF) suffers from two drawbacks. First it requires costly and non-efficient data collection and updating procedure; secondly the method goes through time-consuming data pre-processing before it outputs user position. This paper proposes Cluster-based RF Fingerprinting (CRFF) to overcome these limitations by using modified Minimization of Drive Tests data which can be autonomously collected by cellular operators from their subscribers. The effect of environmental…

SCCF Parameter and Similarity Measure Optimization and Evaluation

2019

Neighborhood-based Collaborative Filtering (CF) is one of the most successful and widely used recommendation approaches; however, it suffers from major flaws especially under sparse environments. Traditional similarity measures used by neighborhood-based CF to find similar users or items are not suitable in sparse datasets. Sparse Subspace Clustering and common liking rate in CF (SCCF), a recently published research, proposed a tunable similarity measure oriented towards sparse datasets; however, its performance can be maximized and requires further analysis and investigation. In this paper, we propose and evaluate the performance of a new tuning mechanism, using the Mean Absolute Error (MA…

Automated prostate gland segmentation based on an unsupervised fuzzy C-means clustering technique using multispectral T1w and T2w MR imaging

2017

Prostate imaging analysis is difficult in diagnosis, therapy, and staging of prostate cancer. In clinical practice, Magnetic Resonance Imaging (MRI) is increasingly used thanks to its morphologic and functional capabilities. However, manual detection and delineation of prostate gland on multispectral MRI data is currently a time-expensive and operator-dependent procedure. Efficient computer-assisted segmentation approaches are not yet able to address these issues, but rather have the potential to do so. In this paper, a novel automatic prostate MR image segmentation method based on the Fuzzy C-Means (FCM) clustering algorithm, which enables multispectral T1-weighted (T1w) and T2-weighted (T…