You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
87 lines
55 KiB
XML
87 lines
55 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<class-scheme publication-date="2023-02-01" scheme-type="cpc" publication-type="official">
|
|
<classification-item breakdown-code="false" not-allocatable="true" level="5" additional-only="false" sort-key="G06N" definition-exists="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph>In this subclass non-limiting references (in the sense of paragraph 39 of the Guide to the IPC) may still be displayed in the scheme.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="true" level="6" additional-only="false" sort-key="G06N3/00" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/00</classification-symbol>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N3/00" definition-exists="true" ipc-concordant="G06N3/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N3/00</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Computing arrangements based on biological models</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N3/002" definition-exists="true" ipc-concordant="G06N3/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/002</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Biomolecular computers, i.e. using biomolecules, proteins, cells </text><reference><text>using DNA <class-ref scheme="cpc">G06N3/123</class-ref>; using neurons <class-ref scheme="cpc">G06N3/061</class-ref></text></reference></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N3/004" definition-exists="true" ipc-concordant="G06N3/004" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/004</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Artificial life, i.e. computing arrangements simulating life</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/006" definition-exists="true" ipc-concordant="G06N3/006" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/006</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/008" definition-exists="true" ipc-concordant="G06N3/008" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/008</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>based on physical entities controlled by simulated intelligence so as to replicate intelligent life forms, e.g. based on robots replicating pets or humans in their appearance or behaviour</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N3/02" definition-exists="true" ipc-concordant="G06N3/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/02</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Neural networks</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/04" definition-exists="true" ipc-concordant="G06N3/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/04</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Architecture, e.g. interconnection topology</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N3/04</class-ref> is impacted by reclassification into groups <class-ref scheme="cpc">G06N3/0464</class-ref>, <class-ref scheme="cpc">G06N3/0475</class-ref>, <class-ref scheme="cpc">G06N3/0495</class-ref> and <class-ref scheme="cpc">G06N3/0499</class-ref>.<br/>All groups listed in this Warning should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0409" definition-exists="true" ipc-concordant="G06N3/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2019-01-01" status="published"><classification-symbol>G06N3/0409</classification-symbol><class-title date-revised="2019-01-01"><title-part><CPC-specific-text><text>Adaptive resonance theory [ART] networks</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0418" definition-exists="true" ipc-concordant="G06N3/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/0418</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>using chaos or fractal principles</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/042" definition-exists="true" ipc-concordant="G06N3/042" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/042</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Knowledge-based neural networks</text></title-part><title-part><text>Logical representations of neural networks</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/043" definition-exists="true" ipc-concordant="G06N3/043" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/043</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>based on fuzzy logic, fuzzy membership or fuzzy inference, e.g. adaptive neuro-fuzzy inference systems [ANFIS]</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/044" definition-exists="true" ipc-concordant="G06N3/044" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/044</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Recurrent networks, e.g. Hopfield networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N3/044</class-ref> is impacted by reclassification into group <class-ref scheme="cpc">G06N3/0442</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/044</class-ref> and <class-ref scheme="cpc">G06N3/0442</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="11" additional-only="false" sort-key="G06N3/0442" definition-exists="false" ipc-concordant="G06N3/0442" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0442</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0442</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/044</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/044</class-ref> and <class-ref scheme="cpc">G06N3/0442</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/045" definition-exists="true" ipc-concordant="G06N3/045" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/045</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Combinations of networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N3/045</class-ref> is impacted by reclassification into group <class-ref scheme="cpc">G06N3/0455</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/045</class-ref> and <class-ref scheme="cpc">G06N3/0455</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="11" additional-only="false" sort-key="G06N3/0455" definition-exists="false" ipc-concordant="G06N3/0455" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0455</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Auto-encoder networks</text></title-part><title-part><text>Encoder-decoder networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0455</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/045</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/045</class-ref> and <class-ref scheme="cpc">G06N3/0455</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0463" definition-exists="true" ipc-concordant="G06N3/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/0463</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Neocognitrons</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0464" definition-exists="false" ipc-concordant="G06N3/0464" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0464</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Convolutional networks [CNN, ConvNet]</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0464</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/04</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/04</class-ref> and <class-ref scheme="cpc">G06N3/0464</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/047" definition-exists="true" ipc-concordant="G06N3/047" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/047</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Probabilistic or stochastic networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N3/047</class-ref> is impacted by reclassification into group <class-ref scheme="cpc">G06N3/0475</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/047</class-ref> and <class-ref scheme="cpc">G06N3/0475</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0475" definition-exists="false" ipc-concordant="G06N3/0475" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0475</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Generative networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0475</class-ref> is incomplete pending reclassification of documents from groups <class-ref scheme="cpc">G06N3/04</class-ref> and <class-ref scheme="cpc">G06N3/047</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/04</class-ref>, <class-ref scheme="cpc">G06N3/047</class-ref>, and <class-ref scheme="cpc">G06N3/0475</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/048" definition-exists="true" ipc-concordant="G06N3/048" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/048</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Activation functions</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/049" definition-exists="true" ipc-concordant="G06N3/049" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/049</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Temporal neural networks, e.g. delay elements, oscillating neurons or pulsed inputs</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0495" definition-exists="false" ipc-concordant="G06N3/0495" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0495</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Quantised networks</text></title-part><title-part><text>Sparse networks</text></title-part><title-part><text>Compressed networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0495</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/04</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/04</class-ref> and <class-ref scheme="cpc">G06N3/0495</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0499" definition-exists="false" ipc-concordant="G06N3/0499" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0499</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Feedforward networks</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0499</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/04</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/04</class-ref> and <class-ref scheme="cpc">G06N3/0499</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/06" definition-exists="true" ipc-concordant="G06N3/06" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/06</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/061" definition-exists="true" ipc-concordant="G06N3/06" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/061</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>using biological neurons, e.g. biological neurons connected to an integrated circuit</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/063" definition-exists="true" ipc-concordant="G06N3/063" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/063</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>using electronic means</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="11" additional-only="false" sort-key="G06N3/065" definition-exists="true" ipc-concordant="G06N3/065" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/065</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Analogue means</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/067" definition-exists="true" ipc-concordant="G06N3/067" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/067</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>using optical means</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="11" additional-only="false" sort-key="G06N3/0675" definition-exists="true" ipc-concordant="G06N3/067" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/0675</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>using electro-optical, acousto-optical or opto-electronic means</text></CPC-specific-text></title-part></class-title></classification-item></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/08" definition-exists="true" ipc-concordant="G06N3/08" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/08</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>Learning methods</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N3/08</class-ref> is impacted by reclassification into groups <class-ref scheme="cpc">G06N3/0895</class-ref>, <class-ref scheme="cpc">G06N3/09</class-ref>, <class-ref scheme="cpc">G06N3/091</class-ref>, <class-ref scheme="cpc">G06N3/092</class-ref>, <class-ref scheme="cpc">G06N3/094</class-ref>, <class-ref scheme="cpc">G06N3/096</class-ref>, <class-ref scheme="cpc">G06N3/098</class-ref> and <class-ref scheme="cpc">G06N3/0985</class-ref>.<br/>All groups listed in this Warning should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/082" definition-exists="true" ipc-concordant="G06N3/082" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/082</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>modifying the architecture, e.g. adding, deleting or silencing nodes or connections</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/084" definition-exists="true" ipc-concordant="G06N3/084" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/084</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Backpropagation, e.g. using gradient descent</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/086" definition-exists="true" ipc-concordant="G06N3/086" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/086</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>using evolutionary algorithms, e.g. genetic algorithms or genetic programming</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/088" definition-exists="true" ipc-concordant="G06N3/088" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/088</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Non-supervised learning, e.g. competitive learning</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0895" definition-exists="false" ipc-concordant="G06N3/0895" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0895</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Weakly supervised learning, e.g. semi-supervised or self-supervised learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0895</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/0895</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/09" definition-exists="false" ipc-concordant="G06N3/09" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/09</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Supervised learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/09</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/09</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/091" definition-exists="false" ipc-concordant="G06N3/091" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/091</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Active learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/091</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/091</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/092" definition-exists="false" ipc-concordant="G06N3/092" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/092</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Reinforcement learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/092</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/092</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/094" definition-exists="false" ipc-concordant="G06N3/094" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/094</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Adversarial learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/094</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/094</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/096" definition-exists="false" ipc-concordant="G06N3/096" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/096</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Transfer learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/096</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/096</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/098" definition-exists="false" ipc-concordant="G06N3/098" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/098</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Distributed learning, e.g. federated learning</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/098</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/098</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/0985" definition-exists="false" ipc-concordant="G06N3/0985" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/0985</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Hyperparameter optimisation</text></title-part><title-part><text>Meta-learning</text></title-part><title-part><text>Learning-to-learn</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N3/0985</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N3/08</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N3/08</class-ref> and <class-ref scheme="cpc">G06N3/0985</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/10" definition-exists="true" ipc-concordant="G06N3/10" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/10</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Interfaces, programming languages or software development kits, e.g. for simulating neural networks</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N3/105" definition-exists="true" ipc-concordant="G06N3/10" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/105</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Shells for specifying net layout</text></CPC-specific-text></title-part></class-title></classification-item></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N3/12" definition-exists="true" ipc-concordant="G06N3/12" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N3/12</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>using genetic models</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/123" definition-exists="true" ipc-concordant="G06N3/123" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/123</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>DNA computing</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N3/126" definition-exists="true" ipc-concordant="G06N3/126" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N3/126</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Evolutionary algorithms, e.g. genetic algorithms or genetic programming</text></title-part></class-title></classification-item></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N5/00" definition-exists="true" ipc-concordant="G06N5/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N5/00</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Computing arrangements using knowledge-based models</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N5/01" definition-exists="true" ipc-concordant="G06N5/01" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/01</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Dynamic search techniques</text></title-part><title-part><text>Heuristics</text></title-part><title-part><text>Dynamic trees</text></title-part><title-part><text>Branch-and-bound</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/013" definition-exists="true" ipc-concordant="G06N5/01" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/013</classification-symbol><class-title date-revised="2023-01-01"><title-part><CPC-specific-text><text>Automatic theorem proving</text></CPC-specific-text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N5/02" definition-exists="true" ipc-concordant="G06N5/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/02</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Knowledge representation</text></title-part><title-part><text>Symbolic representation</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/022" definition-exists="false" ipc-concordant="G06N5/022" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/022</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Knowledge engineering</text></title-part><title-part><text>Knowledge acquisition</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N5/025" definition-exists="false" ipc-concordant="G06N5/025" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/025</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Extracting rules from data</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/027" definition-exists="true" ipc-concordant="G06N5/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N5/027</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Frames</text></CPC-specific-text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N5/04" definition-exists="true" ipc-concordant="G06N5/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/04</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Inference or reasoning models</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/041" definition-exists="true" ipc-concordant="G06N5/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N5/041</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Abduction</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/042" definition-exists="true" ipc-concordant="G06N5/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N5/042</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Backward inferencing</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/043" definition-exists="true" ipc-concordant="G06N5/043" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/043</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Distributed expert systems</text></title-part><title-part><text>Blackboards</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/045" definition-exists="true" ipc-concordant="G06N5/045" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/045</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Explanation of inference</text></title-part><title-part><text>Explainable artificial intelligence [XAI]</text></title-part><title-part><text>Interpretable artificial intelligence</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/046" definition-exists="true" ipc-concordant="G06N5/046" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/046</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Forward inferencing</text></title-part><title-part><text>Production systems</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N5/047" definition-exists="false" ipc-concordant="G06N5/047" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/047</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Pattern matching networks</text></title-part><title-part><text>Rete networks</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N5/048" definition-exists="true" ipc-concordant="G06N5/048" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N5/048</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Fuzzy inferencing</text></title-part></class-title></classification-item></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N7/00" definition-exists="true" ipc-concordant="G06N7/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N7/00</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Computing arrangements based on specific mathematical models</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N7/01" definition-exists="true" ipc-concordant="G06N7/01" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N7/01</classification-symbol><class-title date-revised="2023-01-01"><title-part><text>Probabilistic graphical models, e.g. probabilistic networks</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N7/02" definition-exists="true" ipc-concordant="G06N7/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N7/02</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>using fuzzy logic </text><reference><text>computing arrangements based on biological models <class-ref scheme="cpc">G06N3/00</class-ref>; computing arrangements using knowledge-based models <class-ref scheme="cpc">G06N5/00</class-ref></text></reference></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N7/023" definition-exists="false" ipc-concordant="G06N7/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/023</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Learning or tuning the parameters of a fuzzy system</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N7/026" definition-exists="false" ipc-concordant="G06N7/02" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/026</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Development tools for entering the parameters of a fuzzy system</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N7/04" definition-exists="true" ipc-concordant="G06N7/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/04</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>Physical realisation</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N7/043" definition-exists="false" ipc-concordant="G06N7/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/043</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Analogue or partially analogue implementation</text></CPC-specific-text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="10" additional-only="false" sort-key="G06N7/046" definition-exists="false" ipc-concordant="G06N7/04" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2023-01-01" status="published"><classification-symbol>G06N7/046</classification-symbol><class-title date-revised="2023-01-01"><title-part><CPC-specific-text><text>Implementation by means of a neural network </text><reference><text>neural networks using fuzzy logic <class-ref scheme="cpc">G06N3/043</class-ref></text></reference></CPC-specific-text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="9" additional-only="false" sort-key="G06N7/06" definition-exists="true" ipc-concordant="G06N7/06" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/06</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>Simulation on general purpose computers</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N7/08" definition-exists="true" ipc-concordant="G06N7/08" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N7/08</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>using chaos models or non-linear system models</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N10/00" definition-exists="true" ipc-concordant="G06N10/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/00</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Quantum computing, i.e. information processing based on quantum-mechanical phenomena</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-source">Group <class-ref scheme="cpc">G06N10/00</class-ref> is impacted by reclassification into groups <class-ref scheme="cpc">G06N10/20</class-ref>, <class-ref scheme="cpc">G06N10/40</class-ref>, <class-ref scheme="cpc">G06N10/60</class-ref>, <class-ref scheme="cpc">G06N10/70</class-ref> and <class-ref scheme="cpc">G06N10/80</class-ref>.<br/>All groups listed in this Warning should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N10/20" definition-exists="true" ipc-concordant="G06N10/20" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/20</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Models of quantum computing, e.g. quantum circuits or universal quantum computers</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N10/20</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N10/00</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N10/00</class-ref> and <class-ref scheme="cpc">G06N10/20</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N10/40" definition-exists="true" ipc-concordant="G06N10/40" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/40</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N10/40</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N10/00</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N10/00</class-ref> and <class-ref scheme="cpc">G06N10/40</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N10/60" definition-exists="true" ipc-concordant="G06N10/60" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/60</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Quantum algorithms, e.g. based on quantum optimisation, quantum Fourier or Hadamard transforms</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N10/60</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N10/00</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N10/00</class-ref> and <class-ref scheme="cpc">G06N10/60</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N10/70" definition-exists="true" ipc-concordant="G06N10/70" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/70</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Quantum error correction, detection or prevention, e.g. surface codes or magic state distillation</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N10/70</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N10/00</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N10/00</class-ref> and <class-ref scheme="cpc">G06N10/70</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N10/80" definition-exists="true" ipc-concordant="G06N10/80" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2022-01-01" status="published"><classification-symbol>G06N10/80</classification-symbol><class-title date-revised="2022-01-01"><title-part><text>Quantum programming, e.g. interfaces, languages or software-development kits for creating or handling programs capable of running on quantum computers</text></title-part><title-part><text>Platforms for simulating or accessing quantum computers, e.g. cloud-based quantum computing</text></title-part></class-title><notes-and-warnings><note type="warning"><note-paragraph warning-type="reclass-destination">Group <class-ref scheme="cpc">G06N10/80</class-ref> is incomplete pending reclassification of documents from group <class-ref scheme="cpc">G06N10/00</class-ref>.<br/>Groups <class-ref scheme="cpc">G06N10/00</class-ref> and <class-ref scheme="cpc">G06N10/80</class-ref> should be considered in order to perform a complete search.</note-paragraph></note></notes-and-warnings></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N20/00" definition-exists="true" ipc-concordant="G06N20/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2021-08-01" status="published"><classification-symbol>G06N20/00</classification-symbol><class-title date-revised="2019-01-01"><title-part><text>Machine learning</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N20/10" definition-exists="false" ipc-concordant="G06N20/10" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2021-08-01" status="published"><classification-symbol>G06N20/10</classification-symbol><class-title date-revised="2019-01-01"><title-part><text>using kernel methods, e.g. support vector machines [SVM]</text></title-part></class-title></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N20/20" definition-exists="true" ipc-concordant="G06N20/20" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2021-08-01" status="published"><classification-symbol>G06N20/20</classification-symbol><class-title date-revised="2019-01-01"><title-part><text>Ensemble learning</text></title-part></class-title></classification-item></classification-item>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="7" additional-only="false" sort-key="G06N99/00" definition-exists="true" ipc-concordant="G06N99/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N99/00</classification-symbol><class-title date-revised="2013-01-01"><title-part><text>Subject matter not provided for in other groups of this subclass</text></title-part></class-title>
|
|
<classification-item breakdown-code="false" not-allocatable="false" level="8" additional-only="false" sort-key="G06N99/007" definition-exists="true" ipc-concordant="G06N99/00" c-set-base-allowed="false" c-set-subsequent-allowed="true" date-revised="2013-01-01" status="published"><classification-symbol>G06N99/007</classification-symbol><class-title date-revised="2013-01-01"><title-part><CPC-specific-text><text>Molecular computers, i.e. using inorganic molecules </text><reference><text>using biomolecules <class-ref scheme="cpc">G06N3/002</class-ref></text></reference></CPC-specific-text></title-part></class-title></classification-item></classification-item></classification-item></classification-item></class-scheme> |