Sökning: "discrete data"

Visar resultat 1 - 5 av 469 avhandlingar innehållade orden discrete data.

1. 1. Order in the random forest

   Författare :Isak Karlsson; Henrik Boström; Lars Asker; Pierre Geurts; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Machine learning; random forest; ensemble; time series; data series; sequential data; sparse data; high-dimensional data; Computer and Systems Sciences; data- och systemvetenskap;

   Sammanfattning : In many domains, repeated measurements are systematically collected to obtain the characteristics of objects or situations that evolve over time or other logical orderings. Although the classification of such data series shares many similarities with traditional multidimensional classification, inducing accurate machine learning models using traditional algorithms are typically infeasible since the order of the values must be considered. LÄS MER

3. 2. Studies in Efficient Discrete Algorithms

   Författare :DZMITRY SLEDNEU; Matematik (naturvetenskapliga fakulteten); []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algorithms; Approximation algorithms; Graphs;

   Sammanfattning : This thesis consists of five papers within the design and analysis of efficient algorithms.In the first paper, we consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. We develop a combinatorial randomized algorithm that runs in subcubic time for a special class of graphs. LÄS MER

4. 3. Finding, extracting and exploiting structure in text and hypertext

   Författare :Ola Ågren; Jürgen Börstler; Frank Drewes; Maarten de Rijke; Umeå universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automatic propagation; CHiC; Data mining; Discrete data; Extraction; Hierarchies; ProT; Rank distribution; S²ProT; Spatial linking; Web mining; Web searching; Computer science; Datalogi; business data processing; administrativ databehandling;

   Sammanfattning : Data mining is a fast-developing field of study, using computations to either predict or describe large amounts of data. The increase in data produced each year goes hand in hand with this, requiring algorithms that are more and more efficient in order to find interesting information within a given time. LÄS MER

5. 4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

   Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

   Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

7. 5. INCREMENTAL FAULT DIAGNOSABILITY AND SECURITY/PRIVACY VERIFICATION

   Författare :Mona Noori-Hosseini; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Temporal logic; Anonymity; Opacity; Discrete event systems.; Automation; Formal verification; Fault diagnosability; Incremental abstraction;

   Sammanfattning : Dynamical systems can be classified into two groups. One group is continuoustime systems that describe the physical system behavior, and therefore are typically modeled by differential equations. The other group is discrete event systems (DES)s that represent the sequential and logical behavior of a system. LÄS MER