Search results for "Machine"

showing 10 items of 2592 documents

Alignment-free Genomic Analysis via a Big Data Spark Platform

2021

Abstract Motivation Alignment-free distance and similarity functions (AF functions, for short) are a well-established alternative to pairwise and multiple sequence alignments for many genomic, metagenomic and epigenomic tasks. Due to data-intensive applications, the computation of AF functions is a Big Data problem, with the recent literature indicating that the development of fast and scalable algorithms computing AF functions is a high-priority task. Somewhat surprisingly, despite the increasing popularity of Big Data technologies in computational biology, the development of a Big Data platform for those tasks has not been pursued, possibly due to its complexity. Results We fill this impo…

FOS: Computer and information sciencesStatistics and Probabilitysequence analysisComputer science0206 medical engineeringBig data02 engineering and technologyMachine learningcomputer.software_genreBiochemistry03 medical and health sciencesSpark (mathematics)MapReduceMolecular Biology030304 developmental biology0303 health sciencesSettore INF/01 - Informaticabusiness.industryBioinformatics High Performance Computing Compressed Data StructuresMapReduce; hadoop; sequence analysisComputer Science ApplicationsComputational MathematicsTask (computing)Computer Science - Distributed Parallel and Cluster ComputingComputational Theory and MathematicsDistributed Parallel and Cluster Computing (cs.DC)Artificial intelligencehadoopbusinesscomputer020602 bioinformaticsBioinformatics
researchProduct

Exact affine counter automata

2017

We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS, which is conjectured not to be recognized by affin…

FOS: Computer and information sciencesTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESautomataFormal Languages and Automata Theory (cs.FL)GeneralizationComputer scienceFOS: Physical sciencesComputer Science - Formal Languages and Automata Theorycounter automataМатематика0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)01 natural sciencesquantum computinglcsh:QA75.5-76.95Deterministic pushdown automatonComputer Science (miscellaneous)0202 electrical engineering electronic engineering information engineeringQuantum finite automataPromise problemTime complexityDiscrete mathematicsQuantum Physicscomputational complexityFinite-state machinelcsh:MathematicsИнформатикаpushdown automatalcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesКибернетикаAutomatonComputer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceAffine transformationaffine computingQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theory
researchProduct

Semantic Computing of Moods Based on Tags in Social Media of Music

2014

Social tags inherent in online music services such as Last.fm provide a rich source of information on musical moods. The abundance of social tags makes this data highly beneficial for developing techniques to manage and retrieve mood information, and enables study of the relationships between music content and mood representations with data substantially larger than that available for conventional emotion research. However, no systematic assessment has been done on the accuracy of social tags and derived semantic models at capturing mood information in music. We propose a novel technique called Affective Circumplex Transformation (ACT) for representing the moods of music tracks in an interp…

FOS: Computer and information sciencesVocabularyComputer scienceMusic information retrievalmedia_common.quotation_subjectSemantic analysis (machine learning)Moodscomputer.software_genreAffect (psychology)SemanticsComputer Science - Information RetrievalSemantic computingMusic information retrievalAffective computingmedia_commonSocial and Information Networks (cs.SI)ta113Probabilistic latent semantic analysisSocial tagsbusiness.industryComputer Science - Social and Information NetworksMultimedia (cs.MM)Semantic analysisComputer Science ApplicationsMoodComputational Theory and MathematicsWeb miningta6131Vector space modelArtificial intelligenceGenresbusinesscomputerComputer Science - MultimediaInformation Retrieval (cs.IR)MusicNatural language processingPrediction.Information SystemsIEEE Transactions on Knowledge and Data Engineering
researchProduct

Characterizing the maximum parameter of the total-variation denoising through the pseudo-inverse of the divergence

2017

International audience; We focus on the maximum regularization parameter for anisotropic total-variation denoising. It corresponds to the minimum value of the regularization parameter above which the solution remains constant. While this value is well know for the Lasso, such a critical value has not been investigated in details for the total-variation. Though, it is of importance when tuning the regularization parameter as it allows fixing an upper-bound on the grid for which the optimal parameter is sought. We establish a closed form expression for the one-dimensional case, as well as an upper-bound for the two-dimensional case, that appears reasonably tight in practice. This problem is d…

FOS: Computer and information sciences[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image Processing[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingStatistics - Machine Learning[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]RegularizationPseudo-inverse[ INFO.INFO-TI ] Computer Science [cs]/Image ProcessingMachine Learning (stat.ML)[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]Total-variation[ STAT.TH ] Statistics [stat]/Statistics Theory [stat.TH]Divergence
researchProduct

Semantic HMC for Big Data Analysis

2014

International audience; Analyzing Big Data can help corporations to im-prove their efficiency. In this work we present a new vision to derive Value from Big Data using a Semantic Hierarchical Multi-label Classification called Semantic HMC based in a non-supervised Ontology learning process. We also proposea Semantic HMC process, using scalable Machine-Learning techniques and Rule-based reasoning.

FOS: Computer and information sciences[ INFO.INFO-TT ] Computer Science [cs]/Document and Text Processingmulti-classifyComputer scienceComputer Science - Artificial IntelligenceBig data[ INFO.INFO-WB ] Computer Science [cs]/Websemantic technologies02 engineering and technologyOntology (information science)Semantic data model[ INFO.INFO-DC ] Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Semantic similarity020204 information systemsSemantic computing0202 electrical engineering electronic engineering information engineeringontologyInformation retrievalOntology learningbusiness.industryOntology-based data integration[INFO.INFO-WB]Computer Science [cs]/WebBig-Data[INFO.INFO-TT]Computer Science [cs]/Document and Text ProcessingArtificial Intelligence (cs.AI)machine learningOntologySemantic technologyIndex Terms—classification020201 artificial intelligence & image processing[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]business
researchProduct

Implicit differentiation for fast hyperparameter selection in non-smooth convex learning

2022

International audience; Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but non-smooth. We show that the forward-mode differentiation of proximal gradient descent and proximal coordinate descent yield sequences of Jacobians converging toward the exact Jacobian. Using implicit differentiation, we show it is possible to leverage the non-smoothness of the inner problem to speed up the computation. Finally, we provide a bound on the error made on the hypergradient when the inner optimization problem is solved approxim…

FOS: Computer and information sciencesbilevel optimizationComputer Science - Machine Learninghyperparameter selec- tionMachine Learning (stat.ML)[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]generalized linear modelsMachine Learning (cs.LG)Convex optimizationStatistics - Machine Learning[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Optimization and Control (math.OC)FOS: Mathematics[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]hyperparameter optimizationLassoMathematics - Optimization and Control[MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]
researchProduct

Dimensionality Reduction via Regression in Hyperspectral Imagery

2015

This paper introduces a new unsupervised method for dimensionality reduction via regression (DRR). The algorithm belongs to the family of invertible transforms that generalize Principal Component Analysis (PCA) by using curvilinear instead of linear features. DRR identifies the nonlinear features through multivariate regression to ensure the reduction in redundancy between he PCA coefficients, the reduction of the variance of the scores, and the reduction in the reconstruction error. More importantly, unlike other nonlinear dimensionality reduction methods, the invertibility, volume-preservation, and straightforward out-of-sample extension, makes DRR interpretable and easy to apply. The pro…

FOS: Computer and information sciencesbusiness.industryDimensionality reductionComputer Vision and Pattern Recognition (cs.CV)Feature extractionNonlinear dimensionality reductionDiffusion mapComputer Science - Computer Vision and Pattern RecognitionPattern recognitionMachine Learning (stat.ML)CollinearityReduction (complexity)Statistics - Machine LearningSignal ProcessingPrincipal component analysisArtificial intelligenceElectrical and Electronic EngineeringbusinessMathematicsCurse of dimensionality
researchProduct

A Unified SVM Framework for Signal Estimation

2013

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of several properties of Mercer's kernels and functional analysis to develop a family of SVM methods for estimation in DSP. Three types of signal model equations are analyzed. First, when a specific time-signal structure is assumed to model the underlying system that generated the data, the linear signal model (so called Primal Signal Model formulation) is first stated and analyzed. T…

FOS: Computer and information sciencesbusiness.industryNoise (signal processing)Computer scienceApplied MathematicsSpectral density estimationArray processingPattern recognitionMachine Learning (stat.ML)Statistics - ApplicationsSupport vector machineKernel (linear algebra)Kernel methodComputational Theory and MathematicsStatistics - Machine LearningArtificial IntelligenceSignal ProcessingApplications (stat.AP)Computer Vision and Pattern RecognitionArtificial intelligenceElectrical and Electronic EngineeringStatistics Probability and UncertaintybusinessDigital signal processingReproducing kernel Hilbert space
researchProduct

Identifying Causal Effects via Context-specific Independence Relations

2019

Causal effect identification considers whether an interventional probability distribution can be uniquely determined from a passively observed distribution in a given causal structure. If the generating system induces context-specific independence (CSI) relations, the existing identification procedures and criteria based on do-calculus are inherently incomplete. We show that deciding causal effect non-identifiability is NP-hard in the presence of CSIs. Motivated by this, we design a calculus and an automated search procedure for identifying causal effects in the presence of CSIs. The approach is provably sound and it includes standard do-calculus as a special case. With the approach we can …

FOS: Computer and information sciencescontext-specific independence relationsComputer Science - Machine LearningArtificial Intelligence (cs.AI)Computer Science - Artificial Intelligenceeducationkausaliteetticausal effect identification113 Computer and information sciencesMachine Learning (cs.LG)
researchProduct

Study design in causal models

2012

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mechanism together with the causal structure and allow the direct application of causal calculus in the estimation of the causal effects. The flow of the study is visualized by ordering the nodes of the causal diagram in two dimensions by their causal order and the time of the observation. Conclusions whether a causal or observational relationship can be estimated from the collect…

FOS: Computer and information sciencesdesignstructural equation modelG.362A01 62-09 62F99 62D05 62P10 62K99 68T30graphical modelMachine Learning (stat.ML)G.2.2Statistics - ApplicationsG.3; G.2.2Methodology (stat.ME)missing dataStatistics - Machine LearningkausaliteettiApplications (stat.AP)epidemiologiaStatistics - Methodology
researchProduct