Now showing items 1-20 of 79

• #### A lower bound for learning distributions generated by probabilistic automata ﻿

(Springer, 2010)
Conference report
Open Access
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. ...
• #### A new spectral method for latent variable models ﻿

(2018-05-22)
Article
Open Access
We present an algorithm for the unsupervised learning of latent variable models based on the method of moments. We give efficient estimates of the moments for two models that are well known, e.g., in text mining, the ...
• #### A positive relativization of polynomial time vs. polylog space ﻿

(1991-05)
External research report
Open Access
Can every set in P be solved in polylogarithmic space? We show that this question is equivalent to asking whether the classes PSPACE and EXPTIME are always equal under relativization. We use an oracle access mechanism that ...
• #### Adaptive distributed mechanism againts flooding network attacks based on machine learning ﻿

(ACM Press, NY, 2008)
Conference report
Restricted access - publisher's policy
Adaptive techniques based on machine learning and data mining are gaining relevance in self-management and self- defense for networks and distributed systems. In this paper, we focus on early detection and stopping of ...
• #### Adaptive on-line software aging prediction based on machine learning ﻿

(IEEE Computer Society Publications, 2010)
Conference report
Open Access
The growing complexity of software systems is resulting in an increasing number of software faults. According to the literature, software faults are becoming one of the main sources of unplanned system outages, and have ...
• #### Adaptive parameter-free learning from evolving data streams ﻿

(2009-03)
External research report
Open Access
We propose and illustrate a method for developing algorithms that can adaptively learn from data streams that change over time. As an example, we take Hoeffding Tree, an incremental decision tree inducer for data streams, ...
• #### Adaptive sampling methods for scaling up knowledge discovery algorithms ﻿

(2001-07)
External research report
Open Access
One of the biggest research challenges in KDD and Data Mining is to develop methods that scale up well to large amounts of data. A possible approach for achieving scalability is to take a random sample and do data mining ...
• #### Adaptive scheduling on power-aware managed data-centers using machine learning ﻿

(2011)
External research report
Open Access
Energy-related costs have become one of the major economic factors in IT data-centers, and companies and the research community are currently working on new efficient power-aware resource management strategies, also known ...
• #### Adaptive scheduling on power-aware managed data-centers using machine learning ﻿

(IEEE Computer Society Publications, 2011)
Conference report
Restricted access - publisher's policy
Energy-related costs have become one of the major economic factors in IT data-centers, and companies and the research community are currently working on new efficient power-aware resource management strategies, also known ...
• #### Adaptively learning probabilistic deterministic automata from data streams ﻿

(2014-07)
Article
Restricted access - publisher's policy
Markovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ...

(Elsevier, 2017-12-17)
Conference report
Open Access
Traffic management is being more important than ever, especially in overcrowded big cities with over-pollution problems and with new unprecedented mobility changes. In this scenario, road-traffic prediction plays a key ...
• #### Algorithms for learning finite automata from queries: a unified view ﻿

(1996-09)
External research report
Open Access
In this survey we compare several known variants of the algorithm for learning deterministic finite automata via membership and equivalence queries. We believe that our presentation makes it easier to understand what ...
• #### An approach to correctness of data parallel algorithms ﻿

(1991-05)
External research report
Open Access
The design of data parallel algorithms for fine-grained SIMD machines is a fundamental domain in today computer science. High standards in the specification and resolution of problems have been achieved in the sequential ...
• #### An efficient closed frequent itemset miner for the MOA stream mining system ﻿

(2015-01-07)
Article
Open Access
Mining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent ...
• #### An efficient closed frequent itemset miner for the MOA stream mining system ﻿

(2013)
External research report
Open Access
Mining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent ...
• #### An integer linear programming representation for data-center power-aware management ﻿

(2010-11-12)
External research report
Open Access
This work exposes how to represent a grid data-center based scheduling problem, taking the advantages of the virtualization and consolidation techniques, as a linear integer programming problem including all three mentioned ...
• #### An optimal anytime estimation algorithm ﻿

(2004-12)
External research report
Open Access
In many applications a key step is estimating some unknown quantity ~$mu$ from a sequence of trials, each having expected value~$mu$. Optimal algorithms are known when the task is to estimate $mu$ within a multiplicative ...
• #### An optimal parallel algorithm for learning DFA ﻿

(Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993-01-01)
External research report
Open Access
In 1987, D. Angluin presented an algorithm that exactly learns regular languages represented by deterministic finite automata (dfa) from Membership and Equivalence queries. Furthermore, the algorithm is feasible in the ...
• #### Applying trust metrics based on user interactions to recommendation in social networks ﻿

(2012)
External research report
Open Access
Recommender systems have been strongly researched within the last decade. With the arising and popularization of digital social networks a new field has been opened for social recommendations. Considering the network ...
• #### Assessing spatiotemporal correlations from data for short-term traffic prediction using multi-task learning ﻿

(Elsevier, 2018-12-04)
Article
Open Access
Traffic flow prediction is a fundamental problem for efficient transportation control and management. However, most current data-driven traffic prediction work found in the literature have focused on predicting traffic ...