GB2606795A - Selection controller artificial neutral network-scann - Google Patents

Selection controller artificial neutral network-scann Download PDF

Info

Publication number
GB2606795A
GB2606795A GB2118189.6A GB202118189A GB2606795A GB 2606795 A GB2606795 A GB 2606795A GB 202118189 A GB202118189 A GB 202118189A GB 2606795 A GB2606795 A GB 2606795A
Authority
GB
United Kingdom
Prior art keywords
measurements
row
bmu
action
threshold
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
GB2118189.6A
Other versions
GB2606795B (en
GB202118189D0 (en
Inventor
Vincent Burpee Anthony
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cybyt Ltd
Original Assignee
Cybyt Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cybyt Ltd filed Critical Cybyt Ltd
Publication of GB202118189D0 publication Critical patent/GB202118189D0/en
Publication of GB2606795A publication Critical patent/GB2606795A/en
Application granted granted Critical
Publication of GB2606795B publication Critical patent/GB2606795B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/04Architecture, e.g. interconnection topology
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01NINVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N15/00Investigating characteristics of particles; Investigating permeability, pore-volume, or surface-area of porous materials
    • G01N15/10Investigating individual particles
    • G01N15/14Electro-optical investigation, e.g. flow cytometers
    • GPHYSICS
    • G10MUSICAL INSTRUMENTS; ACOUSTICS
    • G10LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
    • G10L13/00Speech synthesis; Text to speech systems
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01NINVESTIGATING OR ANALYSING MATERIALS BY DETERMINING THEIR CHEMICAL OR PHYSICAL PROPERTIES
    • G01N15/00Investigating characteristics of particles; Investigating permeability, pore-volume, or surface-area of porous materials
    • G01N15/10Investigating individual particles
    • G01N15/14Electro-optical investigation, e.g. flow cytometers
    • G01N2015/1488Methods for deciding
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/02Neural networks
    • G06N3/08Learning methods
    • G06N3/088Non-supervised learning, e.g. competitive learning

Abstract

The present invention provides a method for configuring a selection controller the selection controller to be used for choosing an action to be taken on an item; the method comprising creating a feature map and creating thresholds for association with the nodes on the feature map.

Description

Selection Controller Artificial Neural Network -SCANN
Background
Selection controllers are used to determine the appropriate action to be taken on an item.
They do so by analysing measurements of the item to determine what kind of item the item is. Upon determining the item type, the selection controller can then initiate the appropriate action for an item of that item type.
For example, on a production line, items coming off the production line may be arriving at a high rate, and decisions of which action to take must be taken quickly. Additionally, in a customer call centre where the confirmation of statutory compliance is a major rate limiting step in the efficiency and effectiveness of the sales process. Also, in flow cytometry cell sorters where the selection of sub-populations for sorting in either enriched or high purity mode is a major rate limiting step in the efficiency and effectiveness of the discovery process. What is required in these examples is a selection controller which can use high dimensional data and that is capable of making decisions quickly whilst allowing the specificity of every decision to be modified accordingly.
The measurements of the item can typically exceed three dimensions. For example, in addition to height width and depth, the weight, colour and transparency may be measured.
Each scalar quantity that is measured and analyses adds an extra dimension to the measurement data. The item can then be assigned a point in this multi-dimensional measurement space. The position of the point can be analysed to determine the item type, however, analysing high dimensional data is computing power intensive, this coupled with the requirement for fast paced decision making by the controller presents a problem.
Therefore, there is a need for a way to produce selection controllers capable of producing selections based on fast paced analyses of high dimensional data.
Summary
The present invention in its various aspects is as set out in the appended claims. The present invention provides: A method for configuring a selection controller, the selection controller to be used for choosing an action to be taken on an item; the method comprising: creating a series of N-dimensional reference points, where each dimension has been converted to a scalar quantity, known as a Feature Map (FM), creating the FM by: populating an N-dimensional space with a variable number of starting nodes, the starting nodes each occupying a position in the N-dimensional space; wherein each of the N dimensions are associated with a measurement of the item; randomly selecting training data that has the same dimensionality as the starting nodes; and repositioning the starting nodes to fit the training data to obtain finished nodes; wherein the finished nodes are the repositioned starting nodes; each finished node having a unique identifier; obtaining a data set having a plurality of rows of measurements, each row having the same dimensionality as the starting nodes; wherein each row of measurements is associated with a unique item and in each column in the row of measurements is associated with one of the N dimensions and contains the result of a measurement the unique item; for each row of the plurality of rows of measurements: calculating the distance between the row of measurements and each finished node; assigning the row of the plurality of rows of measurements to a best matching unit, BMU, wherein the BMU is the finished node closest to the row of measurements; recording the unique identifier of the finished node associated with the best matching unit and the distance between the row of measurements and the best matching unit, wherein the distance between the row of measurements and the best matching unit is the feature map item distance, FMID; and for each of the N dimensions: determining the distance between column of the row of measurements associated with the dimension and the position of the BMU in the dimension; for each finished node: in each of the N dimensions; creating a threshold for association with the BMU in the dimension; and associating the unique identifier of each finished node in the system with one action of a plurality of actions; configuring the controller to determine what action should be taken on an item by obtaining a row of measurements associated with the item, the row of measurements haying the same dimensionality as the starting nodes, associating the row of measurements with a BMU; and determining that the action associated with the unique identifier of the BMU should be taken.
Description
The present invention provides a method for configuring a selection controller the selection controller to be used for choosing an action to be taken on an item. The method comprises: Creating a feature map FM, creating the FM is achieved by populating an N-dimensional space with a variable number of starting nodes, the starting nodes each occupying a position in the N-dimensional space. Here N is a positive integer and is equal to the number of dimensions in the N-dimensional space. Each of the N dimensions are associated with a measurement of the item, the measurement having been converted to a scalar value. Each measurement of the item is a scalar quantity. As such, the item can be represented as a point in the N dimensional space. The feature map is generated algorithmically and is preferably a self-organising feature map (SOFM) Next, training data is randomly selected. The training data has the same dimensionality as the starting nodes. Finally, the starting nodes are repositioned to fit the training data to obtain finished nodes. wherein the finished nodes are the repositioned starting nodes. Each finished node is assigned a unique identifier. During the repositioning step, the starting nodes may be referred to as training nodes. After the finished nodes are obtained, the FM has been created. The starting nodes are repositioned such that the finished nodes best fit the training data. And as such the controller will be able to distinguish between different types of item when in use. Repositioning the nodes may be done using an unsupervised learning algorithm, preferably a competitive learning algorithm. 2N
The number of starting nodes may be equal to -j-2 This initial choice is based on bimodal populations, where N=1 there would be 2 populations, where N=2 there would be 4, 3 is 8, 4 is 16 etc. The method further comprises obtaining a data set having a plurality of rows of measurements and for each row of the plurality of rows of measurements an passing the data set through the FM. Passing the data set through the FM comprising: Assigning the row of the plurality of rows of measurements to a best matching unit, BMU, and recording the unique identifier of the finished node associated with the best matching unit.
A BMU is the finished node that is closest to the row of measurements in the N dimensional space. Closest here meaning the shortest distance. Therefore, the finished node that has the shortest distance to the row of measurements in the N-dimensional space is chosen is the BMU for the row of measurements.
Each row of measurements has the same dimensionality as the finished nodes so that the distance between each row of measurements and the finished nodes can be determined.
The starting nodes and training data may be selected at random from one or more larger data sets. The one or more data sets may have a higher dimensionality than the starting nodes. The starting nodes may be obtained by selecting, at random, a number of rows of a larger data set, the number of rows selected being equal to the number of starting nodes, and of those selected rows, selecting N columns. Each column relating to one of the N dimensions.
Similarly, the training data may be obtained by selecting, at random, a number of rows of measurements from one or more larger data sets, the number of rows selected being equal to the number of training data, and of those selected rows, selecting the same N columns as for the starting nodes to ensure that the training data and the starting nodes have the same dimensionality.
The starting nodes and training data are preferably taken form the same larger data set but may be taken from different large data sets.
The step of obtaining a data set may be achieved by, selecting all of the rows of a larger data set and selecting the same N columns as for the starting nodes to ensure that the data set and the finished nodes have the same dimensionality.
The starting nodes, training data and data set are preferably taken form the same larger data set but may be taken from different larger data sets.
The method may further include, after passing the data set through the FM, preferably with 2N -2 starting nodes, iteratively repeating the creation of the FM using a different number of starting nodes to optimise the FM for speed and accuracy, accuracy here refereeing to how well the FM partitions the training data. After the creation of each new FM, the data set will be passed through the FM so that it can be determined if the most recent iteration of the FM is an improvement on the last. The choice of the number of starting nodes in each iteration may be made using a bisection algorithm such as the one disclosed in (Knuth, Donald (1998). Sorting and searching. The Art of Computer Programming. 3 (2nd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-201-89685-5.). Iteratively varying the number of starting nodes in this way ensures that the data passed through the FM is being partitioned accurately, if too few starting nodes are used, the differences between rows of measurements (items) will not be determined accurately by the FM as there are not enough categories (finished nodes) for the item to be classified as. On the other hand, if too many starting nodes are used, it may be the case that the additional starting nodes are not providing any significant improvement in accuracy but are increasing the number of computations required on each row of measurements analysed by the selection controller. If the step of iteratively repeating the creation of the FM using a different number of starting nodes to optimise the FM for speed and accuracy is implemented, the resulting optimised FM will be used for the remainder of the method.
Alternatively, to iteratively repeating the creation of the FM using a different number of starting nodes, the method may further in iteratively repeating the creation of the FM using a different number of dimensions to optimise for speed and accuracy. The choice of the number of starting nodes in each iteration may be made using a bisection algorithm such as the one disclosed in (Knuth, Donald (1998). Sorting and searching. The Art of Computer Programming. 3 (2nd ed.). Reading, MA: Addison-Wesley Professional. ISBN 978-0-20189685-5.). It may be the case that one or more of the N dimensions considered in the first FM created do not impact the quality of the data partitioning and therefore that their inclusion in the FM is increasing the number of computations required for each row of measurements analysed by the selection controller without providing any benefit in terms of improved partitioning. Further, there may be a dimension that was not considered in the first FM that, if considered would provide greatly improved partitioning. If the step of iteratively repeating the creation of the FM using a different number of dimensions to optimise the FM for speed and accuracy is implemented, the resulting optimised FM will be used for the remainder of the method.
To achieve the most accurate FM the method may include both iteratively repeating the creation of the FM using a different number of starting nodes and iteratively repeating the creation of the FM using a different number of dimensions to optimise for speed and accuracy. In this case, if both steps are implemented, the resulting optimised FM will be used for the remainder of the method. It is preferable if the number of starting nodes is optimised in before the number of dimensions. Iterating through the starting nodes is computationally less demanding than iterating through the number of dimensions. Optimising the number of starting nodes first therefore uses less computing power as the FM that is optimised for the number of dimensions is already partially optimised.
The method further comprises iteratively analysing the distance between each row of measurements and the BMU in the FM to determine the distance of each row of measurements from its closest BMU.
The method further comprises calculating the N-dimensional distance between each row of measurements and their respective BMUs in the FM and recording that information on a per row basis, FMID.
The method further comprises, for each BMU, in each of the N dimensions and the FMID, creating a threshold for association with the BMU. This step results in N+1 thresholds for association with each BMU, one in each dimension plus the FMID. The threshold in each measurement may comprise an upper threshold and a lower threshold. In any given measurement, the upper threshold and lower threshold are above and below the position of the BMU in the given measurement. Creating a threshold for association with each BMU prevents incorrect classification of an item.
Creating a threshold for association with each BMU comprises in each of the N dimensions may comprise: for each dimension: building a binned frequency distribution histogram of the distance for each item to the BMU; calculating the maximum measured distance from the BMU to any associated row above the BMU; setting the upper threshold to a number which is a fraction of that distance; and calculating the maximum measured distance from the BMU to any associated row below the BMU; and setting the lower threshold to a number which is a fraction of that distance.
Each finished node may further be associated with one of a plurality of item classes, an item class defining a range of values the measurements of a given item must be within in order for the item to be associated with the item class. The plurality of item classes may be stored in a separate database. The upper and lower thresholds, the fractions can therefore be set such that each row of measurements positioned between the threshold and the BMU are associated with the item class. This ensures that the action associated with the BMU will only be carried out on items that are within the item class associated with the BMU. This is beneficial as every row of measurements can be assigned to a BMU as a BMU is simply the closest finished node to the row of measurements. It is possible however that the row of measurements is an outlier in that it is very far from any of the finished nodes in the FM such that none of the actions associated with the finished nodes would be appropriate, i.e., the item described by the row of measurements does not fall into any of the item classes. Defining the item class and using the item class to define the thresholds ensures that outliers will not have an incorrect action taken on them. Further, associating each node with an item class in this way cross references the finished nodes, which arise from unsupervised partitioning of training data, with measurables in the real world. An optional, but important aspect of implementation of the present invention is that if the trained dataset does not identify a single item class for a given node, for example a plurality of item classes per node then the training should be repeated with a greater number of nodes so as to enable item classes to be properly differentiated based upon a single node. A further, optional, but important aspects of implantation of the present invention is therefore that if more than one node only identifies a single item class the training should be repeated with a fewer number of nodes so as to enable item classes to be efficiently identified.
An item class is preferably a single object. An example of a single object item class is a biological cell, for example a blood cell.
The method further comprises associating the unique identifier of each finished node in the system with an action. When the controller is in use, if a row of measurements is within the threshold of its best matching unit in each of the N dimensions then the action will be performed on an item associated with the row of measurements. The controller may be configured to define a null action, the null action being the action that is carried out if the row of measurements is not associated with a BMU.
The controller may define a null node in the N dimensional space. The Null node associated with the null action. Any row of measurements that is not associated with the BMU is associated with the null node. This allows a user to check which rows of measurements are in the null node, i.e., which items have had the null action taken on them. This is important because, in the example of a postal sorting office, with the actions being sending an item of mail to another location, even the items that cannot be characterised still need to be sent. The null action could therefore be sending the items to a human operative for sorting.
The method further comprises configuring the controller determine what action should be taken on an item by obtaining a row of measurements associated with the item, the row of measurements having the same dimensionality as the starting nodes, associating the row of measurements with a BMU; and determining that the action associated with the unique identifier of the BMU should be taken.
Associating the row of measurements with a BMU to determine the appropriate action for the item may preferably comprise: Determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node each of the N dimensions; and if the row of measurements is between the threshold and the BMU in each of the N dimensions, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU; if the row of measurements lies outside of the threshold in any or all of the N dimensions, the selection controller initiates a null action. A null action may be taking no action at all. A null action may alternatively be any action appropriate for an item that cannot be assigned to a BMU, disposal for example. This method of determining the appropriate action for an item is preferable when precision is of the upmost importance. An example scenario of when this precise method of determining the correct action to be taken may be needed is in sorting parcels for shipping globally. The actions in this case would be shipping a package to a given country. The costs of shipping an item to the wrong country are high and each item must be shipped so the number of null actions needs to be minimised.
The speed of decision making could be improved by clustering finished nodes. To provide this improvement in speed, the controller may alternatively be configured to: for each action of the plurality of actions, assigning the action a number from 1 to n with n being the number of actions, and associating each action with a cluster of finished nodes, the cluster of finished nodes being all of the finished nodes being associated with that action. Then associating the row of measurements with a BMU to determine the appropriate action for the item comprises: In an iteration through each of the plurality of actions starting with the first action; determining the distance between the row of measurements and each finished node in the cluster associated with the action, determining which finished node in the cluster is closest to the row of measurements; comparing the row of measurements to the threshold for association with the closest finished node in each of the N dimensions; and if the row of measurements is between the threshold and the BMU in each of the N dimensions, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU. If the row of measurements is not within threshold for association with the BMU in each of the N dimensions, checking the next action. If the row of measurements is not within threshold for association with the BMU in each of the N dimensions for any action, determining that a null action should be taken.
Alternatively, if speed of decision making is the most important factor to consider, for example in flow cytometry where half a million decisions per second need to be made at the cells are passing through the tube at a high speed (up to 15 metres per second). Associating the row of measurements with a BMU to determine the appropriate action for the item may then require the controller be further configured to: for each action of the plurality of actions, defining a range for association with the action in each of the N dimensions; and assign the action a number from 1 to n with n being the number of actions. Then associating the row of measurements with a BMU to determine the appropriate action for the item comprises: In an iteration through each of the plurality of actions starting with the first action; determining, for each of the N dimensions whether the row of measurements is within the range for association with the action; If the row of measurements is within the range for association with the action, determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node in each of the N dimensions; and if the row of measurements is between the threshold and the BMU in each of the N dimensions, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU. If the row of measurements is not within the range for association with the action, checking the next action. If the row of measurements is not in within the range for association with action for any action, determining that a null action should be taken To further increase the speed of decision making, in addition to the controller being configured to: for each action of the plurality of actions, defining a range for association with the action in each of the N dimensions; and assign the action a number from 1 to n with n being the number of actions, the controller may be further configured to associate each action with a cluster of finished nodes, the cluster of finished nodes being all of the finished nodes being associated with that action. Then associating the row of measurements with a BMU to determine the appropriate action for the item comprises: In an iteration through each of the plurality of actions starting with the first action; determining, for each of the N dimensions whether the row of measurements is within the range for association with the action; If the row of measurements is not within the range for association with the action, checking the next action. If the row of measurements is not in within the range for association with action for any action, determining that a null action should be taken. If the row of measurements is within the range for association with the action, determining the distance between the row of measurements and each finished node in the cluster associated with the action, determining which finished node in the cluster is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node in each of the N dimensions; and if the row of measurements is between the threshold and the closest finished node in each of the N dimensions, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU.
All of the above considered methods for associating the row of measurements with a BMU to determine the appropriate action for the item share the benefit of the fact that they only require the use of simple arithmetic (Pythagoras theorem) to determine the best matching unit. This is beneficial as it allows the present invention to associate a row of measurements with a BMU and therefore an action quickly and efficiently.
The selection controller may be configured on a processor, and used on a processor. It is not a requirement that the processor that the controller is configured on is the same as the processer that runs the configured controller. For example, in the field of flow cytometry, the FM may be configured on a workstation computer and then the configured FM may be uploaded to a cell sorter so that the cell sorter can use the configured FM to sort cells.
In another aspect, the present invention provides a selection controller configured in the manner set out above.
The selection controller configured to take as input a row of measurements, each row of measurements having the same dimensionality as the finished nodes. The selection controller configured to determine a Best Matching Unit for the row of measurements, BMU, the BMU being the finished node that is closest to the row of measurements in the N dimensional space.
The selection controller is further configured to compare the row of measurements to the threshold for association with the BMU in each of the N dimensions.
If the row of measurements is between the threshold and the BMU in each of the N dimensions, then the selection controller assigns the row of measurements to the BMU and initiates the action associated with the BMU.
If the row of measurements lies outside of the threshold in any or all of the N dimensions, the selection controller does not initiate any action.
For a row of measurements that lies outside of the threshold of the BMU, the controller may assign the row of measurements a status of "don't know" to indicate that the row of measurements could not be assigned to any BMU and that therefore the appropriate action is not known Here the benefit of the present invention is clear, a row of measurements may always be determined to be closest to a given node in the system, even if in reality it is simply very far from all the nodes. To prevent incorrect actions being taken on rows of measurements that are too far from the BMU, the threshold for association with each BMU is created.
In the context of the present invention, being too far from the BMU can be related to not being associated with an ITEM class.
The selection controller is preferably configured to take as input one row of measurements at a time such that the selection controller analyses a row of measurements and instigates the appropriate action before analysing another row. It should be noted that due to the fact that only simple arithmetic is used to determine if a row of data can be assigned to a best matching unit, this process can happen on a very fast timescale.
The selection controller may be configured within a system having one or more sensors, the one or more sensors each taking one or more measurements of an item. Each measurement of the item corresponding to one of the N dimensions.
Use Cases Cytometry The selection controller may be configured to determine the type of cells passing through a flow cytometry system. In this case, each of the N dimensions may be a measure of an intensity of a type of protein present on the surface of the cell and therefore each row of measurements contains N measurements of intensity of different proteins.
Cell sorters are sensitive devices which require continual monitoring, this FM method provides a means to evaluate all cell populations providing an early indicator of any instrument instability saving valuable sample from being poured into the drain.
Additionally, complex N dimensional cell type definitions are needed to sort cells, but these definitions are time consuming to construct and difficult to refine. This method provides a way to rapidly and define the cells of interest and allows that definition to be fine-tuned to sort the cells of interest.
Production line The selection controller may be configured to sort items in a production line. In this case each row of measurements contains measurements of an item on the production line, for example height, weight, depth, length, colour. The actions therefore may be to either allow the item to continue on the production line or to remove the item if the item does not conform to the desired measurements in one or more of the dimensions.
Voice Analytics and statutory compliance Organizations throughout the world face complex regulations. With an increasing number of regulations, the burden to understanding, managing, and gaining insight from voice data is more important than ever. In areas such as Compliance, Risk Management, Regulatory Intelligence, Regulatory Reporting and Fraud Detection.
While the use of voice analytics has become increasingly prevalent in regulated businesses and the ability to generate and action real-time change from key business insights has lagged significantly. By coupling FM with voice analytics high dimension data, over 500 different measurements per second, it is possible to ensure that business employees can be prompted in real-time to meet their statutory obligations while talking with clients dynamically improving overall compliance. A plurality of FM systems keyed on core compliance issues can be used to ensure that each interaction with clients has the best chance of soft-landing a compliant interaction.

Claims (25)

  1. Claims 1 A method for configuring a selection controller, the selection controller to be used for choosing an action to be taken on an item; the method comprising: creating a series of N-dimensional reference points, where each dimension has been converted to a scalar quantity, known as a Feature Map (FM), creating the FM by: populating an N-dimensional space with a variable number of starting nodes, the starting nodes each occupying a position in the N-dimensional space; wherein each of the N dimensions are associated with a measurement of the item; randomly selecting training data that has the same dimensionality as the starting nodes; and repositioning the starting nodes to fit the training data to obtain finished nodes; wherein the finished nodes are the repositioned starting nodes; each finished node having a unique identifier; obtaining a data set having a plurality of rows of measurements, each row having the same dimensionality as the starting nodes; wherein each row of measurements is associated with an unique item and in each column in the row of measurements is associated with one of the N dimensions and contains the result of a measurement the unique item; for each row of the plurality of rows of measurements: calculating the distance between the row of measurements and each finished node; assigning the row of the plurality of rows of measurements to a best matching unit, BMU, wherein the BMU is the finished node closest to the row of measurements; recording the unique identifier of the finished node associated with the BMU and the distance between the row of measurements and the BMU, wherein the distance between the row of measurements and the BMU is the feature map item distance, FMID; and for each of the N dimensions: determining the distance between column of the row of measurements associated with the dimension and the position of the BMU in the dimension; for each finished node: in each of the N dimensions; creating a threshold for association with the BMU in the dimension; associating the unique identifier of each finished node in the system with one action of a plurality of actions; configuring the controller to determine what action should be taken on an item by obtaining a row of measurements associated with the item, the row of measurements having the same dimensionality as the starting nodes, associating the row of measurements with a BMU; and determining that the action associated with the unique identifier of the BMU should be taken.
  2. 2. The method of any preceding claim wherein: during the repositioning step the nodes are referred to as training node
  3. 3. The method of any preceding claim wherein the starting nodes and training data are extracted from a larger data set.
  4. 4. The method of claim 1 wherein the starting nodes are positioned at random in the N dimensional space.
  5. 5. The method of any preceding claim wherein the distance between the row of measurements and each finished node is calculated as a Euclidian distance.
  6. 6. The method of any of claims 1 to 4 wherein the distance between the row of measurements and each finished node is calculated as a Manhattan distance.
  7. 7 The method of any of claims 1 to 4 wherein the distance between the row of measurements and each finished node is calculated as a Minkowski distance.
  8. 8 The method of any preceding claim wherein the number of starting nodes is between 2 and 2".
  9. 9. The method of any preceding claim wherein the number of starting nodes is 2.
  10. 10. The method of any of claims 1 to 8 wherein the number of starting nodes is equal to 2N
  11. 11 The method of any preceding claim wherein, after the step of recording the number of the node associated with the best matching unit; the method further comprises iteratively repeating the step of creating a feature map (FM) using a new variable number of nodes for each iteration; and selecting the FM that is the best fit for the data set; wherein the FM that best fits the data set is used for the remainder of the method.
  12. 12. the method of claim 11, wherein selecting the FM that is the best fit for the data set comprises selecting the FM that has the smallest chi squared distance from the data set.
  13. 13. The method of claim 11 or claim 10, wherein in each iteration, the number of starting nodes is varied.
  14. 14. The method of any preceding claim wherein for each BMU, the threshold for association with the BMU in the dimension comprises an upper threshold and a lower threshold, and creating a threshold for association with the BMU in the dimension comprises in each of the N dimensions comprises: building a binned frequency distribution histogram of the distance for each item to the BMU; calculating the maximum measured distance from the BMU to any associated row above the BMU; and setting the upper threshold to a number which is a fraction of that distance; and calculating the maximum measured distance from the BMU to any associated row below the BMU; and setting the lower threshold to a number which is a fraction of that distance.
  15. 15. The method of claim 14 wherein each finished node is associated with an item class, the item class defining a range of values the measurements of a given item must be within in order for the item to be associated with the item class; for the upper and lower thresholds, the fractions are set such that each row of measurements positioned between the threshold and the BMU are associated with the item class.
  16. 16. The method of any preceding claim, wherein associating the row of measurements with a BMU to determine the appropriate action for the item comprises: determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node each of the N dimensions; and if the row of measurements is between the threshold and the BMU in each of the N dimensions, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU; if the row of measurements lies outside of the threshold in any or all of the N dimensions, the selection controller initiates a null action.
  17. 17. The method of any of claims 1 to 15 wherein the controller is further configured to, for each action of the plurality of actions, defining a range for association with the action in each of the N dimensions; and wherein associating the row of measurements with a BMU to determine the appropriate action for the item comprises: iterating through each of the plurality of actions; determining, for each of the N dimensions whether the row of measurements is within the range for association with the action; If the Row of measurements is within the range for association with the action, Determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node each of the N dimensions; and if the row of measurements for the item is between the upper and lower threshold and the BMU in each of the N dimensions, then the selection controller assigning the closest finished node as the BM U for the row of measurements and initiating the action associated with the unique identifier BMU; If the row of measurements is not within the range for association with the action, checking the next action; if the row of measurements is not in within the range for association with action for any action, determining that a null action should be taken.
  18. 18. The method of any of claims 1 to 15 wherein for each finished node in the FM, the method further comprises creating a FMID threshold; wherein the FMID threshold is a distance from the finished node; and wherein associating the row of measurements with a BMU to determine the appropriate action for the item comprises: Determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the closest finished node in each of the N dimensions; and comparing the FMID of the row of measurements to the FMID threshold of the closest finished node; if the row of measurements is between the threshold and the finished node in each of the N dimensions, and if the FMID of the row of measurements is between the FMID threshold of the closes finished node, the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU; if the row of measurements lies outside of the threshold in any or all of the N dimensions, and or outside of the FMID threshold, the selection controller initiates a null action.
  19. 19. The method of any of claims 1 to 15 wherein for each finished node in the FM, the method further comprises creating a FMID threshold; wherein the FMID threshold is a distance from the finished node; and wherein the controller is further configured to, for each action of the plurality of actions, defining a range for association with the action in each of the N dimensions; and wherein associating the row of measurements with a BMU to determine the appropriate action for the item comprises: iterating through each of the plurality of actions; determining, for each of the N dimensions whether the row of measurements is within the range for association with the action; if the Row of measurements is within the range for association with the action, Determining the distance between the row of measurements and every finished node, determining which finished node is closest to the row of measurements; comparing the row of measurements to the threshold for association with the finished node each of the N dimensions; and comparing the FMID of the row of measurements to the FMID threshold of the closest finished node; if the row of measurements for the item is between the upper and lower threshold and the BMU in each of the N dimensions, and if the FMID of the row of measurements is between the FMID threshold of the closes finished node, then the selection controller assigning the closest finished node as the BMU for the row of measurements and initiating the action associated with the unique identifier BMU; If the row of measurements is not within the range for association with the action, checking the next action; if the row of measurements is not in within the range for association with action for any action, determining that a null action should be taken;
  20. 20. The method of any preceding claim wherein, for each finished node, the selection controller is configured to present a user with an option for the selection controller to not consider one or more of the FMID threshold or one or more of the thresholds for association with the finished node in the N dimensions.
  21. 21. The method of any preceding claim wherein the FM a self-organising feature map (SO FM).
  22. 22. The method of any preceding claim wherein the selection controller is configured to, when in use, record the determined action for each row of measurements.
  23. 23. The method of any preceding claim wherein the method further comprises configuring the selection controller to, when in use to monitor the percentage of rows of measurements that are being associated with each finished node within a quantized time period; and comparing the percentages to the percentages of rows of measurements assigned to each finished node during configuration.
  24. 24. The method of any preceding claim wherein the selection controller is further configured to calibrate the conversion of scalar quantities.
  25. 25. A selection controller configured as per any of the preceding claims.
GB2118189.6A 2020-12-16 2021-12-15 Selection controller artificial neutral network- SCANN Active GB2606795B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GBGB2019900.6A GB202019900D0 (en) 2020-12-16 2020-12-16 Selection controller artificial neural network - scann

Publications (3)

Publication Number Publication Date
GB202118189D0 GB202118189D0 (en) 2022-01-26
GB2606795A true GB2606795A (en) 2022-11-23
GB2606795B GB2606795B (en) 2023-09-06

Family

ID=74188825

Family Applications (2)

Application Number Title Priority Date Filing Date
GBGB2019900.6A Ceased GB202019900D0 (en) 2020-12-16 2020-12-16 Selection controller artificial neural network - scann
GB2118189.6A Active GB2606795B (en) 2020-12-16 2021-12-15 Selection controller artificial neutral network- SCANN

Family Applications Before (1)

Application Number Title Priority Date Filing Date
GBGB2019900.6A Ceased GB202019900D0 (en) 2020-12-16 2020-12-16 Selection controller artificial neural network - scann

Country Status (1)

Country Link
GB (2) GB202019900D0 (en)

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
BAÇÃO FERNANDO ET AL: "Self-organizing Maps as Substitutes for K-Means Clustering", 22 May 2005, SAT 2015 18TH INTERNATIONAL CONFERENCE, AUSTIN, TX, USA, SEPTEMBER 24-27, 2015; [LECTURE NOTES IN COMPUTER SCIENCE; LECT.NOTES COMPUTER], SPRINGER, BERLIN, HEIDELBERG, PAGE(S) 476 - 483, ISBN: 978-3-540-74549-5, XP047456840 *
JITVIRIYA WISANU ET AL: "Design of emotion generation model and action selection for robots using a Self Organizing Map", 2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY (ECTI-CON), IEEE, 14 May 2014 (2014-05-14), pages 1 - 6, XP032619621, DOI: 10.1109/ECTICON.2014.6839819 *
KNUTH, DONALD: "The Art of Computer Programming", vol. 3, 1998, ADDISON-WESLEY PROFESSIONAL, article "Sorting and searching"

Also Published As

Publication number Publication date
GB2606795B (en) 2023-09-06
GB202118189D0 (en) 2022-01-26
GB202019900D0 (en) 2021-01-27

Similar Documents

Publication Publication Date Title
US20170316079A1 (en) Scalable tri-point arbitration and clustering
CN105929690B (en) A kind of Flexible Workshop Robust Scheduling method based on decomposition multi-objective Evolutionary Algorithm
Shepel et al. Technology Of Management Decision-Making At Industrial Enterprises In The Digital Economy
US20210144167A1 (en) Apparatus and method for detecting an anomaly in a dataset and computer program product therefor
Martínez-Ballesteros et al. Improving a multi-objective evolutionary algorithm to discover quantitative association rules
Pahmi et al. Implementation of CART (classification and regression trees) algorithm for determining factors affecting employee performance
Pristyanto et al. The effect of feature selection on classification algorithms in credit approval
Köksalan Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
US20220260963A1 (en) Selection Controller Artificial Neural Network - SCANN
Nguyen et al. Internal quality measures for clustering in metric spaces
GB2606795A (en) Selection controller artificial neutral network-scann
TWI599896B (en) Multiple decision attribute selection and data discretization classification method
Abouabdallah et al. Does clustering of DNA barcodes agree with botanical classification directly at high taxonomic levels? Trees in French Guiana as a case study
Cai et al. Fuzzy criteria in multi-objective feature selection for unsupervised learning
Banka et al. Feature selection and classification for gene expression data using evolutionary computation
Kiriş et al. Performance comparison of different clustering methods for manufacturing cell formation
CN112070336A (en) Manufacturing industry information quantitative analysis method and device based on analytic hierarchy process
Li et al. Parameters optimization of back propagation neural network based on memetic algorithm coupled with genetic algorithm
Angesti et al. Prediction of the Telkom University's Undergraduates Waiting Period for Getting a Job using the CART Algorithm
CN113947309B (en) Shield tunnel construction standard working hour measuring and calculating and scoring method based on big construction data
US20050033723A1 (en) Method, system, and computer program product for sorting data
Nijaguna et al. Multiple kernel fuzzy clustering for uncertain data classification
TWI759785B (en) System and method for recommending audit criteria based on integration of qualitative data and quantitative data
Bej Improved imbalanced classification through convex space learning
JP7437545B2 (en) Supplier automatic ranking method, supplier automatic ranking device and supplier automatic ranking program