Search results for "subspace"

showing 10 items of 164 documents

Quantizations from reproducing kernel spaces

2012

Abstract The purpose of this work is to explore the existence and properties of reproducing kernel Hilbert subspaces of L 2 ( C , d 2 z / π ) based on subsets of complex Hermite polynomials. The resulting coherent states (CS) form a family depending on a nonnegative parameter s . We examine some interesting issues, mainly related to CS quantization, like the existence of the usual harmonic oscillator spectrum despite the absence of canonical commutation rules. The question of mathematical and physical equivalences between the s -dependent quantizations is also considered.

[PHYS]Physics [physics]PhysicsPure mathematicsHermite polynomials010102 general mathematicsSpectrum (functional analysis)FOS: Physical sciencesGeneral Physics and AstronomyMathematical Physics (math-ph)coherent states16. Peace & justice01 natural sciencesLinear subspaceQuantization (physics)Kernel (statistics)0103 physical sciencesCoherent statesCommutation0101 mathematics[PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph]010306 general physicsSettore MAT/07 - Fisica MatematicaMathematical PhysicsComputingMilieux_MISCELLANEOUSHarmonic oscillatorAnnals of Physics
researchProduct

Ensemble feature selection with the simple Bayesian classification

2003

Abstract A popular method for creating an accurate classifier from a set of training data is to build several classifiers, and then to combine their predictions. The ensembles of simple Bayesian classifiers have traditionally not been a focus of research. One way to generate an ensemble of accurate and diverse simple Bayesian classifiers is to use different feature subsets generated with the random subspace method. In this case, the ensemble consists of multiple classifiers constructed by randomly selecting feature subsets, that is, classifiers constructed in randomly chosen subspaces. In this paper, we present an algorithm for building ensembles of simple Bayesian classifiers in random sub…

business.industryBayesian probabilityFeature selectionPattern recognitionMachine learningcomputer.software_genreLinear subspaceRandom subspace methodNaive Bayes classifierBayes' theoremComputingMethodologies_PATTERNRECOGNITIONHardware and ArchitectureSignal ProcessingArtificial intelligencebusinesscomputerClassifier (UML)SoftwareCascading classifiersInformation SystemsMathematicsInformation Fusion
researchProduct

Defending Surveillance Sensor Networks Against Data-Injection Attacks Via Trusted Nodes

2018

By injecting false data through compromised sensors, an adversary can drive the probability of detection in a sensor network-based spatial field surveillance system to arbitrarily low values. As a countermeasure, a small subset of sensors may be secured. Leveraging the theory of Matched Subspace Detection, we propose and evaluate several detectors that add robustness to attacks when such trusted nodes are available. Our results reveal the performance-security tradeoff of these schemes and can be used to determine the number of trusted nodes required for a given performance target.

business.industryComputer scienceDetector020206 networking & telecommunications020207 software engineering02 engineering and technologyAdversaryRobustness (computer science)Injection attacks0202 electrical engineering electronic engineering information engineeringbusinessWireless sensor networkSubspace topologyComputer Science::Cryptography and SecurityComputer network
researchProduct

Three-dimensional object detection under arbitrary lighting conditions

2006

A novel method of 3D object recognition independent of lighting conditions is presented. The recognition model is based on a vector space representation using an orthonormal basis generated by the Lambertian reflectance functions obtained with distant light sources. Changing the lighting conditions corresponds to multiplying the elementary images by a constant factor and because of that, all possible lighting views will be elements that belong to that vector space. The recognition method proposed is based on the calculation of the angle between the vector associated with a certain illuminated 3D object and that subspace. We define the angle in terms of linear correlations to get shift and i…

business.industryComputer scienceMaterials Science (miscellaneous)3D single-object recognitionCognitive neuroscience of visual object recognitionInformation Storage and RetrievalReproducibility of ResultsImage EnhancementSensitivity and SpecificityFacial recognition systemIndustrial and Manufacturing EngineeringObject detectionPattern Recognition AutomatedLambertian reflectanceImaging Three-DimensionalOpticsArtificial IntelligenceImage Interpretation Computer-AssistedOrthonormal basisBusiness and International ManagementbusinessAlgorithmsLightingSubspace topologyApplied Optics
researchProduct

Evaluating Classifiers for Mobile-Masquerader Detection

2006

As a result of the impersonation of a user of a mobile terminal, sensitive information kept locally or accessible over the network can be abused. The means of masquerader detection are therefore needed to detect the cases of impersonation. In this paper, the problem of mobile-masquerader detection is considered as a problem of classifying the user behaviour as originating from the legitimate user or someone else. Different behavioural characteristics are analysed by designated one-class classifiers whose classifications are combined. The paper focuses on selecting the classifiers for mobile-masquerader detection. The selection process is conducted in two phases. First, the classification ac…

business.industryComputer scienceSmall numberLinear classifierPattern recognitionMachine learningcomputer.software_genreRandom subspace methodInformation sensitivityComputingMethodologies_PATTERNRECOGNITIONArtificial intelligencebusinesscomputerClassifier (UML)
researchProduct

Diversity in search strategies for ensemble feature selection

2005

Ensembles of learnt models constitute one of the main current directions in machine learning and data mining. Ensembles allow us to achieve higher accuracy, which is often not achievable with single models. It was shown theoretically and experimentally that in order for an ensemble to be effective, it should consist of base classifiers that have diversity in their predictions. One technique, which proved to be effective for constructing an ensemble of diverse base classifiers, is the use of different feature subsets, or so-called ensemble feature selection. Many ensemble feature selection strategies incorporate diversity as an objective in the search for the best collection of feature subse…

business.industryContext (language use)Feature selectionMachine learningcomputer.software_genreEnsemble learningMeasure (mathematics)Random subspace methodEnsembles of classifiersComputingMethodologies_PATTERNRECOGNITIONHardware and ArchitectureFeature (computer vision)Signal ProcessingArtificial intelligenceData miningbusinesscomputerSoftwareSelection (genetic algorithm)Information SystemsMathematics
researchProduct

A robust approach to ERP denoising

2010

The purpose of presented study is to explore possibilities to increase the robustness and improve the performance of the spatial ERP denoising methods proposed in earlier research. The quality of the subspace separation solution may easily be degraded essentially, if the underlying assumptions become noticeably violated, which is a normal situation in practice. The distortions to the results of a separation are caused by non-zero sample signal-noise and noise-noise correlations, which are indistinguishable from the variances of the signal and noise in the framework of the second-order statistical information exploited by the discussed methods. Therefore, in the research reported in this art…

business.industryRobustness (computer science)Noise reductionPattern recognitionArtificial intelligencebusinessSubspace topologyMathematics10th International Conference on Information Science, Signal Processing and their Applications (ISSPA 2010)
researchProduct

The transformation of aromatic molecules into the subspace of their double bonds

1975

A model of new submolecules is presented. As an application some absorptions of aromatic radicals are interpreted in UV and visible spectra. Extension of the model to biological systems is prejudged.

chemistry.chemical_classificationDouble bondchemistryComputational chemistryRadicalMoleculeChiropracticsPhysical and Theoretical ChemistrySubspace topologyTransformation (music)Spectral lineTheoretica Chimica Acta
researchProduct

Canonical correlation in multivariate time series analysis

1997

We analyze a class o f state space identification algorithms for time series, based on canonical correlation analysis in the ligth of recent results on stochastic systems theory calle d « subspace methods » .These can be describe as covariance estimation followed b y stochastic realization .The methods offer the major advantage o f converting the nonlinear parameter estimation phase in traditional V A R M A models identification in to the solution o f Riccati equation but introduce at the same time some no n trivial mathematical problem s related to positivity. The states o f the forward -backward innovations representation have an interpretation : Instrumental Variables estimators .

eEconomicsstatisticseconomic theoryinnovation modelsingular value decomposition[ SHS.ECO ] Humanities and Social Sciences/Economies and financessubspace methodsbalancinginstrumental variables estimtors[SHS.ECO]Humanities and Social Sciences/Economics and Finance[SHS.ECO] Humanities and Social Sciences/Economics and Financeoperations research
researchProduct

Representing compact sets of compact operators and of compact range vector measures

1987

symbols.namesakeApproximation propertyNuclear operatorGeneral MathematicsHilbert spacesymbolsFinite-rank operatorCompact operatorTopologyInvariant subspace problemContinuous functions on a compact Hausdorff spaceCompact operator on Hilbert spaceMathematicsArchiv der Mathematik
researchProduct