Nested categorization using factorization
AssigneeSap SE
InventorNishanth Sastry
Life of this patent
Estimating the term…
Abstract
A system for information item categorization in which each non-leaf node in a hierarchical organization of nodes represents a category, and each leaf node represents an information item. A number P is associated with each node. For non-leaf nodes, the associated number P is selected from a subset of relatively prime elements chosen from an appropriate Unique Factorization Domain (UFD), such as a set of relatively prime numbers which are a subset of the familiar set of integers. For leaf nodes, P is set to 1. A number M is also associated with each node. For each root node, M is set to the value of P for that node. For each non-root node, M is set to the product of the M's of all parent nodes of the node and the P of that node.
Claims14
A method for categorizing information items using a hierarchical structure of nodes, wherein each information item is represented by a leaf node and each category is represented by a non-leaf node in said hierarchical structure, comprising:
- associating a first number with each node, wherein for each non-leaf node said first number is uniquely selected from a subset of relatively prime elements within a unique factorization domain, wherein said subset of relatively prime elements includes at least one nonprime element, wherein elements of said subset of relatively prime elements taken pairwise are all relatively prime to each other, and wherein for each leaf node said first number is equal to one;
- and
- associating a second number with each node, wherein for each root node said second number is equal to said first number, wherein for each non-root node said second number is equal to a product of said second numbers associated with each direct parent node of said non-root node and said first number of said non-root node, and wherein at least one non-root node has multiple direct parents, said second number for said at least one non-root node being equal to a product determined from multiplying said second numbers belonging to each of said multiple direct parents and said first number of said at least one non-root node.
A system including at least one processor and a non-signal computer readable medium having program code stored thereon for, when executed by said processor, categorizing information items using a hierarchical structure of nodes, wherein each information item is represented by a leaf node and each category is represented by a non-leaf node in said hierarchical structure, said program code comprising:
- program code for associating a first number with each node, wherein for each non-leaf node said first number is uniquely selected from a subset of relatively prime elements within a unique factorization domain, wherein said subset of relatively prime elements includes at least one non-prime element, wherein elements of said subset of relatively prime elements taken pairwise are all relatively prime to each other, and wherein for each leaf node said first number is equal to one;
- and
- program code for associating a second number with each node, wherein for each root node said second number is equal to said first number, wherein for each non-root node said second number is equal to a product of said second numbers associated with each direct parent node of said non-root node and said first number of said non-root node, and wherein at least one non-root node has multiple direct parents, said second number for said at least one non-root node being equal to a product determined from multiplying said second numbers belonging to each of said multiple direct parents and said first number of said at least one non-root node.
A computer program product, comprising:
- a non-transitory computer readable medium having program code stored thereon for categorizing information items using a hierarchical structure of nodes, wherein each information item is represented by a leaf node and each category is represented by a non-leaf node in said hierarchical structure, said program code comprising:
- program code for associating a first number with each node, wherein for each non-leaf node said first number is uniquely selected from a subset of relatively prime elements within a unique factorization domain, wherein said subset of relatively prime elements includes at least one non-prime element, wherein elements of said subset of relatively prime elements taken pairwise are all relatively prime to each other, and wherein for each leaf node said first number is equal to one;
- and
- program code for associating a second number with each node, wherein for each root node said second number is equal to said first number, wherein for each non-root node said second number is equal to a product of said second numbers associated with each direct parent node of said non-root node and said first number of said non-root node, and wherein at least one non-root node has multiple direct parents, said second number for said at least one non-root node being equal to a product determined from multiplying said second numbers belonging to each of said multiple direct parents and said first, number of said at least one non-root node.
Dependencies are inferred from the claim text.