About: http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Algorithm

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Class, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Class
disjointWith	http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Data http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Hypothesis http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Operator http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#DM-Task http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#FormalExpression http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#HypothesisStructure http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#IO-Class http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#IO-Object http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#OptimizationProblem http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#ProbabilityDensityEstimation http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#Strategy
subClassOf	http://www.loa-cnr.it/ontologies/DOLCE-Lite.owl#non-physical-endurant nodeID://b665258980 nodeID://b665258981 nodeID://b665258982 nodeID://b665258983 nodeID://b665260330 nodeID://b665260331 nodeID://b665260332 nodeID://b665260333 nodeID://b665764591 nodeID://b665764592 nodeID://b665764593 nodeID://b665764594 nodeID://b665765941 nodeID://b665765942 nodeID://b665765943 nodeID://b665765944
described by	proxy:entity/http/www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl
http://www.e-lico....OP.owl#definition	DM-Algorithm: An algorithm in general is a well defined sequence of steps that specifies how to solve a problem or perform a task. It typically accepts an input and produces an output. A DM algorithm is an algorithm that has been designed to perform any of the DM tasks, such as feature selection, missing value imputation, or modeling (or induction). The higher-level classes of the DM-Algorithm hierarchy correspond to DM-Task types. Immediately below are broad algorithm families or what data miners more commonly call paradigms or approaches. The Algorithm hierarchy bottoms out in individual algorithms such as CART, Lasso or ReliefF. A particular case of a DM algorithm is a Modeling (or Learning) algorithm, which is a well-defined procedure that takes data as input and produces output in the form of models or patterns.
is first of	nodeID://b665258605 nodeID://b665258621 nodeID://b665258627 nodeID://b665258665 nodeID://b665258677 nodeID://b665258721 nodeID://b665258724 nodeID://b665258732 nodeID://b665258743 nodeID://b665258752 nodeID://b665259015 nodeID://b665259228 nodeID://b665259238 nodeID://b665259258 nodeID://b665259366 nodeID://b665259955 nodeID://b665259971 nodeID://b665259977 nodeID://b665260015 nodeID://b665260027 nodeID://b665260071 nodeID://b665260074 nodeID://b665260082 nodeID://b665260093 nodeID://b665260102 nodeID://b665260365 nodeID://b665260578 nodeID://b665260588 nodeID://b665260608 nodeID://b665260716 nodeID://b665764216 nodeID://b665764232 nodeID://b665764238 nodeID://b665764276 nodeID://b665764288 nodeID://b665764332 nodeID://b665764335 nodeID://b665764343 nodeID://b665764354 nodeID://b665764363 nodeID://b665764626 nodeID://b665764839 nodeID://b665764849 nodeID://b665764869 nodeID://b665764977 nodeID://b665765566 nodeID://b665765582 nodeID://b665765588 nodeID://b665765626 nodeID://b665765638 nodeID://b665765682 nodeID://b665765685 nodeID://b665765693 nodeID://b665765704 nodeID://b665765713 nodeID://b665765976 nodeID://b665766189 nodeID://b665766199 nodeID://b665766219 nodeID://b665766327
is domain of	http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasComponentStep http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasComputationalComplexityFunction http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasDecisionRule http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasDistanceOrSimilarityFunction http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasEvaluationFunction http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasOptimizationProblem http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasSimilarityFunction http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#hasStopCriterion
is range of	http://www.e-lico.eu/ontologies/dmo/DMOP/DMOP.owl#realizes

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software