Search results for " learning"

showing 10 items of 5299 documents

Empirical Evaluation of the Bayesian Learning Automaton Family

2009

Masteroppgave i informasjons- og kommunikasjonsteknologi 2009 – Universitetet i Agder, Grimstad The two-armed bandit problem is a classical optimization problem where a player sequentially selects and pulls one of two arms attached to a gambling machine, and each arm pull results in either a reward or penalty to the player. Each arm is associated with a certain reward probability which is unknown to the player, and the player needs to sequentially select and play an arm and receive a reward or a penalty in order to discover its true reward probability. The overall goal for the player is reward maximization, and the player needs to balance between exploiting existing knowledge or obtaining n…

Computer Science::Machine LearningComputer Science::Computer Science and Game Theory
researchProduct

SVM approximation for real-time image segmentation by using an improved hyperrectangles-based method

2003

A real-time implementation of an approximation of the support vector machine (SVM) decision rule is proposed. This method is based on an improvement of a supervised classification method using hyperrectangles, which is useful for real-time image segmentation. The final decision combines the accuracy of the SVM learning algorithm and the speed of a hyperrectangles-based method. We review the principles of the classification methods and we evaluate the hardware implementation cost of each method. We present the combination algorithm, which consists of rejecting ambiguities in the learning set using SVM decision, before using the learning step of the hyperrectangles-based method. We present re…

Computer Science::Machine LearningComputer sciencebusiness.industryGaussianCombination algorithmImage processingPattern recognitionImage segmentationDecision ruleMachine learningcomputer.software_genreSupport vector machinesymbols.namesakeSignal ProcessingsymbolsComputer Vision and Pattern RecognitionArtificial intelligenceElectrical and Electronic EngineeringField-programmable gate arraybusinesscomputerIndustrial inspectionReal-Time Imaging
researchProduct

Rational irreducible characters and rational conjugacy classes in finite groups

2007

We prove that a finite group G G has two rational-valued irreducible characters if and only if it has two rational conjugacy classes, and determine the structure of any such group. Along the way we also prove a conjecture of Gow stating that any finite group of even order has a non-trivial rational-valued irreducible character of odd degree.

Computer Science::Machine LearningFinite groupApplied MathematicsGeneral MathematicsIrreducible elementComputer Science::Digital LibrariesIrreducible fractionCombinatoricsStatistics::Machine LearningConjugacy classCharacter (mathematics)Character tableComputer Science::Mathematical SoftwareOrder (group theory)Character groupMathematicsTransactions of the American Mathematical Society
researchProduct

Homology of pseudodifferential operators on manifolds with fibered cusps

2003

The Hochschild homology of the algebra of pseudodifferential operators on a manifold with fibered cusps, introduced by Mazzeo and Melrose, is studied and computed using the approach of Brylinski and Getzler. One of the main technical tools is a new convergence criterion for tri-filtered half-plane spectral sequences. Using trace-like functionals that generate the 0 0 -dimensional Hochschild cohomology groups, the index of a fully elliptic fibered cusp operator is expressed as the sum of a local contribution of Atiyah-Singer type and a global term on the boundary. We announce a result relating this boundary term to the adiabatic limit of the eta invariant in a particular case.

Computer Science::Machine LearningHochschild homologyApplied MathematicsGeneral MathematicsFibered knotHomology (mathematics)Computer Science::Digital LibrariesCohomologyManifoldAlgebraStatistics::Machine LearningElliptic operatorEta invariantMathematics::K-Theory and HomologySpectral sequenceComputer Science::Mathematical SoftwareMathematicsTransactions of the American Mathematical Society
researchProduct

Understanding star-fundamental algebras

2021

Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.

Computer Science::Machine LearningInvolutionPure mathematicsStar-fundamentalApplied MathematicsGeneral MathematicsStar (graph theory)Polynomial identityComputer Science::Digital LibrariesSettore MAT/02 - AlgebraStatistics::Machine LearningIDEAIS (ÁLGEBRA)Computer Science::Mathematical SoftwareComputer Science::Programming LanguagesInvolution (philosophy)Mathematics
researchProduct

Thompson Sampling for Dynamic Multi-armed Bandits

2011

The importance of multi-armed bandit (MAB) problems is on the rise due to their recent application in a large variety of areas such as online advertising, news article selection, wireless networks, and medicinal trials, to name a few. The most common assumption made when solving such MAB problems is that the unknown reward probability theta k of each bandit arm k is fixed. However, this assumption rarely holds in practice simply because real-life problems often involve underlying processes that are dynamically evolving. In this paper, we model problems where reward probabilities theta k are drifting, and introduce a new method called Dynamic Thompson Sampling (DTS) that facilitates Order St…

Computer Science::Machine LearningMathematical optimizationbusiness.industryComputer scienceOrder statisticBayesian probabilitySampling (statistics)RegretArtificial intelligencebusinessThompson samplingRandom variableSelection (genetic algorithm)2011 10th International Conference on Machine Learning and Applications and Workshops
researchProduct

Fuzzy Clustering of Histopathological Images Using Deep Learning Embeddings

2021

Metric learning is a machine learning approach that aims to learn a new distance metric by increas- ing (reducing) the similarity of examples belonging to the same (different) classes. The output of these approaches are embeddings, where the input data are mapped to improve a crisp or fuzzy classifica- tion process. The deep metric learning approaches regard metric learning, implemented by using deep neural networks. Such models have the advantage to discover very representative nonlinear embed- dings. In this work, we propose a triplet network deep metric learning approach, based on ResNet50, to find a representative embedding for the unsupervised fuzzy classification of benign and maligna…

Computer Science::Machine LearningMetric LearningSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniComputingMethodologies_PATTERNRECOGNITIONDeep LearningHistopathological Images ClassificationSettore INF/01 - InformaticaMetric Learning
researchProduct

Complex group algebras of finite groups: Brauer’s Problem 1

2005

Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.

Computer Science::Machine LearningModular representation theoryPure mathematicsFinite groupBrauer's theorem on induced charactersGroup (mathematics)General MathematicsMathematicsofComputing_GENERALComputer Science::Digital LibrariesRepresentation theoryCombinatoricsStatistics::Machine LearningGroup of Lie typeSymmetric groupComputer Science::Mathematical SoftwareComputer Science::Programming LanguagesBrauer groupMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct

Learning spatial filters for multispectral image segmentation.

2010

International audience; We present a novel filtering method for multispectral satel- lite image classification. The proposed method learns a set of spatial filters that maximize class separability of binary support vector machine (SVM) through a gradient descent approach. Regularization issues are discussed in detail and a Frobenius-norm regularization is proposed to efficiently exclude uninformative filters coefficients. Experiments car- ried out on multiclass one-against-all classification and tar- get detection show the capabilities of the learned spatial fil- ters.

Computer Science::Machine LearningMultispectral image0211 other engineering and technologies02 engineering and technology01 natural sciencesRegularization (mathematics)010104 statistics & probability[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]Life ScienceComputer visionSegmentation0101 mathematicsLarge margin method021101 geological & geomatics engineeringMathematicsImage segmentationContextual image classificationPixelbusiness.industryPattern recognitionImage segmentationSupport vector machineComputingMethodologies_PATTERNRECOGNITIONmultispectral imageSpatial FilteringArtificial intelligenceGradient descentbusiness
researchProduct

Neutral-Current Neutrino-Nucleus Scattering off Xe Isotopes

2018

Large liquid xenon detectors aiming for dark matter direct detection will soon become viable tools also for investigating neutrino physics. Information on the effects of nuclear structure in neutrino-nucleus scattering can be important in distinguishing neutrino backgrounds in such detectors. We perform calculations for differential and total cross sections of neutral-current neutrino scattering off the most abundant xenon isotopes. The nuclear structure calculations are made in the nuclear shell model for elastic scattering, and also in the quasiparticle random-phase approximation (QRPA) and microscopic quasiparticle phonon model (MQPM) for both elastic and inelastic scattering. Using suit…

Computer Science::Machine LearningNuclear and High Energy PhysicsArticle SubjectNuclear TheoryPhysics::Instrumentation and DetectorsSolar neutrinoAstrophysics::High Energy Astrophysical PhenomenaDark matterNuclear TheoryFOS: Physical sciencesInelastic scatteringComputer Science::Digital Libraries01 natural sciencesNuclear Theory (nucl-th)Nuclear physicsStatistics::Machine LearningHigh Energy Physics - Phenomenology (hep-ph)neutrino physics0103 physical sciencesIsotopes of xenonsironta010306 general physicsPhysicsElastic scatteringneutrino-nucleus scatteringta114010308 nuclear & particles physicsScatteringHigh Energy Physics::PhenomenologyNuclear shell modelneutriinotlcsh:QC1-999High Energy Physics - PhenomenologyComputer Science::Mathematical SoftwareHigh Energy Physics::ExperimentNeutrinolcsh:PhysicsAdvances in High Energy Physics
researchProduct