Publications

Abstract

Schizophrenia is a common and complex mental disorder with neuroimaging alterations. Recent neuroanatomical pattern recognition studies attempted to distinguish individuals with schizophrenia by structural magnetic resonance imaging (sMRI) and diffusion tensor imaging (DTI). 1, 2 Applications of cutting-edge machine learning approaches in structural neuroimaging studies have revealed potential pathways to classification of schizophrenia based on regional gray matter volume (GMV) or density or cortical thickness. 3–5 Additionally, cortical folding may have high discriminatory value in correctly identifying symptom severity in schizophrenia. 6 Regional GMV and cortical thickness have also been combined in attempts to differentiate individuals with schizophrenia from healthy controls (HCs). 7 Applications of machine learning algorithms to diffusion imaging data analysis to predict individuals with first-episode schizophrenia (FES) have achieved encouraging accuracy. 8–10 White matter (WM) abnormalities in schizophrenia as estimated by DTI appear to be present in the early stage of the disorder, most likely reflecting the developmental stage of the sample of interest.

Abstract

Identifying data-driven biotypes of major depressive disorder (MDD) has promise for the clarification of diagnostic heterogeneity. However, few studies have focused on white-matter abnormalities for MDD subtyping. This study included 116 patients with MDD and 118 demographically-matched healthy controls assessed by diffusion tensor imaging and neurocognitive evaluation. Hierarchical clustering was applied to the major fiber tracts, in conjunction with tract-based spatial statistics, to reveal white-matter alterations associated with MDD. Clinical and neurocognitive differences were compared between identified subgroups and healthy controls. With fractional anisotropy extracted from 20 fiber tracts, cluster analysis revealed 3 subgroups based on the patterns of abnormalities. Patients in each subgroup versus healthy controls showed a stepwise pattern of white-matter alterations as follows: subgroup 1 (25.9% of patient sample), widespread white-matter disruption; subgroup 2 (43.1% of patient sample), intermediate and more localized abnormalities in aspects of the corpus callosum and left cingulate; and subgroup 3 (31.0% of patient sample), possible mild alterations, but no statistically significant tract disruption after controlling for family-wise error. The neurocognitive impairment in each subgroup accompanied the white-matter alterations: subgroup 1, deficits in sustained attention and delayed memory; subgroup 2, dysfunction in delayed memory; and subgroup 3, no significant deficits. Three subtypes of white-matter abnormality exist in individuals with major depression, those having widespread abnormalities suffering more neurocognitive impairments, which may provide evidence for parsing the heterogeneity of the disorder and help optimize type-specific treatment approaches.

Abstract

Set is widely used as a kind of basic data structure. However, when it is used for large scale data set the cost of storage, search and transport is overhead. The bloom filter uses a fixed size bit string to represent elements in a static set, which can reduce storage space and search cost that is a fixed constant. The time-space efficiency is achieved at the cost of a small probability of false positive in membership query. However, for many applications the space savings and locating time constantly outweigh this drawback. Dynamic bloom filter (DBF) can support concisely representation and approximate membership queries of dynamic set instead of static set. It has been proved that DBF not only possess the advantage of standard bloom filter, but also has better features when dealing with dynamic set. This paper proposes a time-dependent multiple bit-strings bloom filter (TMBF) which roots in the DBF and targets on dynamic incremental set. TMBF uses multiple bit-strings in time order to present a dynamic increasing set and uses backward searching to test whether an element is in a set. Based on the system logs from a real P2P file sharing system, the evaluation shows a 20% reduction in searching cost compared to DBF.