Is the clustering of β-amyloid (Aβ) deposits in the frontal cortex of Alzheimer patients determined by blood vessels?

The clustering pattern of diffuse, primitive and classic β-amyloid (Aβ) deposits was studied in the upper laminae of the frontal cortex of 9 patients with sporadic Alzheimer's disease (AD). Aβ stained tissue was counterstained with collagen type IV antiserum to determine whether the clusters of Aβ deposits were related to blood vessels. In all patients, Aβ deposits and blood vessels were clustered, with in many patients, a regular periodicity of clusters along the cortex parallel to the pia. The classic Aβ deposit clusters coincided with those of the larger blood vessels in all patients and with clusters of smaller blood vessels in 4 patients. Diffuse deposit clusters were related to blood vessels in 3 patients. Primitive deposit clusters were either unrelated to or negatively correlated with the blood vessels in six patients. Hence, Aβ deposit subtypes differ in their relationship to blood vessels. The data suggest a direct and specific role for the larger blood vessels in the formation of amyloid cores in AD. © 1995.

Is the clustering of neurofibrillary tangles in Alzheimer's patients related to the cells of origin of specific cortico-cortical projections?

The spatial pattern of cellular neurofibrillary tangles (NFT) was studied in the supra- and infragranular layers of various cortical regions in cases of Alzheimer's disease (AD). The objective was to test the hypothesis that NFT formation was associated with the cells of origin of specific cortico-cortical projections. The novel feature of the study was that pattern analysis enabled the dimension and spacing of NFT clusters along the cortical ribbon to be estimated. In the majority of brain regions studied, NFT occurred in clusters of neurons which were regularly spaced along the cortical strip. This pattern is consistent with the predicted distribution of the cells of origin of specific cortico-cortico projections. Mean NFT cluster size varied from 250 to > 12800 microns in different cortical tissues suggesting either variation in the size of the cell clusters or a dynamic process in the development of NFT in relation to these cell clusters. The formation of NFT in cell clusters which may give rise to the feed-forward and feed-back cortico-cortical projections suggests a possible route of spread of NFT pathology in AD between cortical regions and from the cortex to subcortical areas.

Changes in the clustering patterns of beta-amyloid (Abeta) with age in Down's syndrome

The spatial distribution patterns of the diffuse, primitive, and classic beta-amyloid (Abeta) deposits were studied in areas of the medial temporal lobe in 12 cases of Down's Syndrome (DS) 35 to 67 years of age. Large clusters of diffuse deposits were present in the youngest patients; cluster size then declined with patient age but increased again in the oldest patients. By contrast, the cluster sizes of the primitive and classic deposits increased with age to a maximum in patients 45 to 55 and 60 years of age respectively and declined in size in the oldest patients. In the parahippocampal gyrus (PHG), the clusters of the primitive deposits were most highly clustered in cases of intermediate age. The data suggest a developmental sequence in DS in which Abeta is deposited initially in the form of large clusters of diffuse deposits that are then gradually replaced by clusters of primitive and classic deposits. The oldest patients were an exception to this sequence in that the pattern of clustering resembled that of the youngest patients.

Clustering patterns of neurofibrillary tangles in Alzheimer’s disease

Clustering of cellular neurofibrillary tangles (NFT) was studied in the cerebral cortex and hippocampus in cases of Alzheimer’s disease (AD) using a regression method. The objective of the study was to test the hypothesis that clustering of NFTs reflects the degeneration of the cortico-cortical pathways. In 25/38 (66%) of analyses of individual brain areas, a significant peak to trough and peak to peak distance was obtained suggesting that the clusters of NFTs were regularly distributed in bands parallel to the tissue boundary. In analyses of cortical tissues with regularly distributed clusters, peak to peak distance was between 1000 and 1600 microns in 13/24 (54%) of analyses, >1600 microns in 10/24 (42%) and <1000 microns in 1/24 (4%) of analyses. A regular distribution of NFT clusters was less evident in the CA sectors of the hippocampus than in the cortex. Hence, in a significant proportion of brain areas, the spacing of NFT clusters along the cerebral cortex was consistent with the predicted distribution of the cells of origin of specific cortico-cortical projections. However, in many brain regions, the sizes of the NFT clusters were larger than predicted which may be attributable to the spread of NFTs to adjacent groups of cells as the disease progresses.

Higher-order co-occurrences for exploratory point pattern analysis and decision tree clustering on spatial data

Analyzing geographical patterns by collocating events, objects or their attributes has a long history in surveillance and monitoring, and is particularly applied in environmental contexts, such as ecology or epidemiology. The identification of patterns or structures at some scales can be addressed using spatial statistics, particularly marked point processes methodologies. Classification and regression trees are also related to this goal of finding "patterns" by deducing the hierarchy of influence of variables on a dependent outcome. Such variable selection methods have been applied to spatial data, but, often without explicitly acknowledging the spatial dependence. Many methods routinely used in exploratory point pattern analysis are2nd-order statistics, used in a univariate context, though there is also a wide literature on modelling methods for multivariate point pattern processes. This paper proposes an exploratory approach for multivariate spatial data using higher-order statistics built from co-occurrences of events or marks given by the point processes. A spatial entropy measure, derived from these multinomial distributions of co-occurrences at a given order, constitutes the basis of the proposed exploratory methods. © 2010 Elsevier Ltd.

Sensitivity of peptide conformational dynamics on clustering of a classical molecular dynamics trajectory

We investigate the sensitivity of a Markov model with states and transition probabilities obtained from clustering a molecular dynamics trajectory. We have examined a 500 ns molecular dynamics trajectory of the peptide valine-proline-alanine-leucine in explicit water. The sensitivity is quantified by varying the boundaries of the clusters and investigating the resulting variation in transition probabilities and the average transition time between states. In this way, we represent the effect of clustering using different clustering algorithms. It is found that in terms of the investigated quantities, the peptide dynamics described by the Markov model is sensitive to the clustering; in particular, the average transition times are found to vary up to 46%. Moreover, inclusion of nonphysical sparsely populated clusters can lead to serious errors of up to 814%. In the investigation, the time step used in the transition matrix is determined by the minimum time scale on which the system behaves approximately Markovian. This time step is found to be about 100 ps. It is concluded that the description of peptide dynamics with transition matrices should be performed with care, and that using standard clustering algorithms to obtain states and transition probabilities may not always produce reliable results.

A peak-clustering method for MEG group analysis to minimise artefacts due to smoothness

Magnetoencephalography (MEG), a non-invasive technique for characterizing brain electrical activity, is gaining popularity as a tool for assessing group-level differences between experimental conditions. One method for assessing task-condition effects involves beamforming, where a weighted sum of field measurements is used to tune activity on a voxel-by-voxel basis. However, this method has been shown to produce inhomogeneous smoothness differences as a function of signal-to-noise across a volumetric image, which can then produce false positives at the group level. Here we describe a novel method for group-level analysis with MEG beamformer images that utilizes the peak locations within each participant's volumetric image to assess group-level effects. We compared our peak-clustering algorithm with SnPM using simulated data. We found that our method was immune to artefactual group effects that can arise as a result of inhomogeneous smoothness differences across a volumetric image. We also used our peak-clustering algorithm on experimental data and found that regions were identified that corresponded with task-related regions identified in the literature. These findings suggest that our technique is a robust method for group-level analysis with MEG beamformer images.

Perceived environmental uncertainty in scenario planning

Scenarioplanning is a strategy tool with growing popularity in both academia and practical situations. Current practices of scenarioplanning are largely based on existing literature which utilises scenarioplanning to develop strategies for the future, primarily considering the assessment of perceived macro-external environmentaluncertainties. However there is a body of literature hitherto ignored by scenarioplanning researchers, which suggests that PerceivedEnvironmentalUncertainty (PEU) influences the micro-external as well as the internal environment of the organisation. This paper reviews the most dominant theories on scenarioplanning process and PEU, developing three propositions for the practice of scenarioplanning process. Furthermore, it shows how these propositions can be integrated in the scenarioplanning process in order to improve the development of strategy.

Scenario planning at business unit level

The scenario planning literature is focused on corporate level interventions. There is a general consensus on the method, but there is little debate about the stages involved in building and using the scenarios. This article presents a case study of a scenario planning intervention, which was conducted at a business unit of the British division of one of the largest beauty and cosmetic products multinationals. The method adopted in this case study has some fundamental differences to the existing models used at corporate level. This research is based on the principles of autoethnography, since its purpose is to present self-critical reflections, enhanced by reflective and reflexive conversations on a scenario planning method used at business unit level. The critical reflections concern a series of critical incidents which distinguish this method from existing intuitive logic scenario planning models which are used at corporate level planning. Ultimately this article contributes to the scenario planning method literature by providing insights into its practice at business unit level. © 2012 Elsevier Ltd.

Clustering web documents using hierarchical representation with multi-granularity

Web document cluster analysis plays an important role in information retrieval by organizing large amounts of documents into a small number of meaningful clusters. Traditional web document clustering is based on the Vector Space Model (VSM), which takes into account only two-level (document and term) knowledge granularity but ignores the bridging paragraph granularity. However, this two-level granularity may lead to unsatisfactory clustering results with “false correlation”. In order to deal with the problem, a Hierarchical Representation Model with Multi-granularity (HRMM), which consists of five-layer representation of data and a twophase clustering process is proposed based on granular computing and article structure theory. To deal with the zero-valued similarity problemresulted from the sparse term-paragraphmatrix, an ontology based strategy and a tolerance-rough-set based strategy are introduced into HRMM. By using granular computing, structural knowledge hidden in documents can be more efficiently and effectively captured in HRMM and thus web document clusters with higher quality can be generated. Extensive experiments show that HRMM, HRMM with tolerancerough-set strategy, and HRMM with ontology all outperform VSM and a representative non VSM-based algorithm, WFP, significantly in terms of the F-Score.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Some clarifications on the DEA clustering approach

This paper clarifies the role of alternative optimal solutions in the clustering of multidimensional observations using data envelopment analysis (DEA). The paper shows that alternative optimal solutions corresponding to several units produce different groups with different sizes and different decision making units (DMUs) at each class. This implies that a specific DMU may be grouped into different clusters when the corresponding DEA model has multiple optimal solutions. © 2011 Elsevier B.V. All rights reserved.

The multiple pheromone ant clustering algorithm and its application to real world domains

The Multiple Pheromone Ant Clustering Algorithm (MPACA) models the collective behaviour of ants to find clusters in data and to assign objects to the most appropriate class. It is an ant colony optimisation approach that uses pheromones to mark paths linking objects that are similar and potentially members of the same cluster or class. Its novelty is in the way it uses separate pheromones for each descriptive attribute of the object rather than a single pheromone representing the whole object. Ants that encounter other ants frequently enough can combine the attribute values they are detecting, which enables the MPACA to learn influential variable interactions. This paper applies the model to real-world data from two domains. One is logistics, focusing on resource allocation rather than the more traditional vehicle-routing problem. The other is mental-health risk assessment. The task for the MPACA in each domain was to predict class membership where the classes for the logistics domain were the levels of demand on haulage company resources and the mental-health classes were levels of suicide risk. Results on these noisy real-world data were promising, demonstrating the ability of the MPACA to find patterns in the data with accuracy comparable to more traditional linear regression models. © 2013 Polish Information Processing Society.

A multiple pheromone ant clustering algorithm

Ant colony optimisation algorithms model the way ants use pheromones for marking paths to important locations in their environment. Pheromone traces are picked up, followed, and reinforced by other ants but also evaporate over time. Optimal paths attract more pheromone and less useful paths fade away. The main innovation of the proposed Multiple Pheromone Ant Clustering Algorithm (MPACA) is to mark objects using many pheromones, one for each value of each attribute describing the objects in multidimensional space. Every object has one or more ants assigned to each attribute value and the ants then try to find other objects with matching values, depositing pheromone traces that link them. Encounters between ants are used to determine when ants should combine their features to look for conjunctions and whether they should belong to the same colony. This paper explains the algorithm and explores its potential effectiveness for cluster analysis. © 2014 Springer International Publishing Switzerland.

Clustering epileptiform discharges in the interictal electroencephalogram with topography preserving maps

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT