1,743 research outputs found

    A Fast Quartet Tree Heuristic for Hierarchical Clustering

    Get PDF
    The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the 3(n4)3{n \choose 4} weighted quartet topologies on nn objects, where optimality means that the summed weight of the embedded quartet topologies is optimal (so it can be the case that the optimal tree embeds all quartets as nonoptimal topologies). We present a Monte Carlo heuristic, based on randomized hill climbing, for approximating the optimal weight tree, given the quartet topology weights. The method repeatedly transforms a dendrogram, with all objects involved as leaves, achieving a monotonic approximation to the exact single globally optimal tree. The problem and the solution heuristic has been extensively used for general hierarchical clustering of nontree-like (non-phylogeny) data in various domains and across domains with heterogeneous data. We also present a greatly improved heuristic, reducing the running time by a factor of order a thousand to ten thousand. All this is implemented and available, as part of the CompLearn package. We compare performance and running time of the original and improved versions with those of UPGMA, BioNJ, and NJ, as implemented in the SplitsTree package on genomic data for which the latter are optimized. Keywords: Data and knowledge visualization, Pattern matching--Clustering--Algorithms/Similarity measures, Hierarchical clustering, Global optimization, Quartet tree, Randomized hill-climbing,Comment: LaTeX, 40 pages, 11 figures; this paper has substantial overlap with arXiv:cs/0606048 in cs.D

    Computational Spectrum of Agent Model Simulation

    Get PDF

    Hierarchy Decomposition for Faster User Equilibria on Road Networks

    Get PDF

    Anomalous Perceptions and Beliefs Are Associated With Shifts Toward Different Types of Prior Knowledge in Perceptual Inference.

    Get PDF
    Psychotic phenomena manifest in healthy and clinical populations as complex patterns of aberrant perceptions (hallucinations) and tenacious, irrational beliefs ( delusions). According to predictive processing accounts, hallucinations and delusions arise from atypicalities in the integration of prior knowledge with incoming sensory information. However, the computational details of these atypicalities and their specific phenomenological manifestations are not well characterized. We tested the hypothesis that hallucination-proneness arises from increased reliance on overly general application of prior knowledge in perceptual inference, generating percepts that readily capture the gist of the environment but inaccurately render its details. We separately probed the use of prior knowledge to perceive the gist vs the details of ambiguous images in a healthy population with varying degrees of hallucination- and delusion-proneness. We found that the use of prior knowledge varied with psychotic phenomena and their composition in terms of aberrant percepts vs aberrant beliefs. Consistent with previous findings, hallucination-proneness conferred an advantage using prior knowledge to perceive image gist but, contrary to predictions, did not confer disadvantage perceiving image details. Predominant hallucination-proneness actually conferred advantages perceiving both image gist and details, consistent with reliance on highly detailed perceptual knowledge. Delusion-proneness, and especially predominance of delusion-proneness over hallucination-proneness, conferred disadvantage perceiving image details but not image gist, though evidence of specific impairment of detail perception was preliminary. We suggest this is consistent with reliance on abstract, belief-like knowledge. We posit that phenomenological variability in psychotic experiences may be driven by variability in the type of knowledge observers rely upon to resolve perceptual ambiguity

    Opportunities and Challenges of Applying Artificial Intelligence in the Financial Sectors and Startups during the Coronavirus Outbreak

    Get PDF
    Purpose: The main goal of this article is the comprehensive study of the applications of artificial intelligence in financial sectors in addition to startups and its impacts on such cases along with Covid19. Methodology: we have tried to study the applications of artificial intelligence in different areas especially financial fields such as accounting, auditing, management, capital market, banking etc. On the other hand, we have studied the impacts of artificial intelligence on startups during Covid-19 too. Findings: The results showed that AI can be a powerful tool in financial fields such as investment advice, asset allocation, fraud detection, portfolio management and etc. and startups such as increasing production and productivity, time management, data management and analysis and etc. during the Covid-19 outbreaks and it can decrease the harmful effects of Coronavirus. Thus, timely actions can be taken. Originality/Value: The main contribution of this paper is a comprehensive and specialized look at the discussion of the applications of artificial intelligence in the field of finance as well as startups during Covid19. We have tried to consider subjects and contents which cover most of the paper

    Automatic Algorithm Selection for Complex Simulation Problems

    Get PDF
    To select the most suitable simulation algorithm for a given task is often difficult. This is due to intricate interactions between model features, implementation details, and runtime environment, which may strongly affect the overall performance. The thesis consists of three parts. The first part surveys existing approaches to solve the algorithm selection problem and discusses techniques to analyze simulation algorithm performance.The second part introduces a software framework for automatic simulation algorithm selection, which is evaluated in the third part.Die Auswahl des passendsten Simulationsalgorithmus fĂĽr eine bestimmte Aufgabe ist oftmals schwierig. Dies liegt an der komplexen Interaktion zwischen Modelleigenschaften, Implementierungsdetails und Laufzeitumgebung. Die Arbeit ist in drei Teile gegliedert. Der erste Teil befasst sich eingehend mit Vorarbeiten zur automatischen Algorithmenauswahl, sowie mit der Leistungsanalyse von Simulationsalgorithmen. Der zweite Teil der Arbeit stellt ein Rahmenwerk zur automatischen Auswahl von Simulationsalgorithmen vor, welches dann im dritten Teil evaluiert wird
    • …
    corecore