Patents by Inventor William K. Perrizo
William K. Perrizo has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7958096Abstract: Systems and methods for performing data mining in a set of binary data arranged as a plurality of data items in which each data item has a plurality of bits, each bit in a corresponding one of a plurality of bit positions. The set of binary data is arranged in the data storage such that the binary data is in bit position groups. Each bit position group corresponds to a different one of the plurality of bit positions and includes bits of the binary data having that bit position. The binary data of each bit position group is compressed to produce data structures representing the set of binary data. A data mining technique is performed using the plurality of compressed data structures.Type: GrantFiled: April 2, 2007Date of Patent: June 7, 2011Assignee: NDSU-Research FoundationInventor: William K. Perrizo
-
Patent number: 7836090Abstract: A system and method for performing and accelerating cluster analysis of large data sets is presented. The data set is formatted into binary bit Sequential (bSQ) format and then structured into a Peano Count tree (P-tree) format which represents a lossless tree representation of the original data. A P-tree algebra is defined and used to formulate a vertical set inner product (VSIP) technique that can be used to efficiently and scalably measure the mean value and total variation of a set about a fixed point in the large dataset. The set can be any projected subspace of any vector space, including oblique sub spaces. The VSIPs are used to determine the closeness of a point to a set of points in the large dataset making the VSIPs very useful in classification, clustering and outlier detection. One advantage is that the number of centroids (k) need not be pre-specified but are effectively determined.Type: GrantFiled: November 17, 2005Date of Patent: November 16, 2010Assignee: NDSU Research FoundationInventors: William K. Perrizo, Taufik Fuadi Abidin, Amal Shehan Perera, Masum Serazi
-
Patent number: 7640219Abstract: Systems and methods of classifying a subject data item based on a training set of pre-classified data items. A piecewise-linear approximation of a local boundary between different classes of data items is automatically computed. The local boundary is approximated by a neighborhood set of data items selected from the training set that have been pre-classified into different classes and have points similar to a point of the subject data item. A class is automatically assigned to the subject data item in accordance with a side of the local boundary on which the subject data item resides.Type: GrantFiled: August 6, 2007Date of Patent: December 29, 2009Assignee: NDSU - Research FoundationInventor: William K. Perrizo
-
Publication number: 20080109437Abstract: A system and method for performing and accelerating cluster analysis of large data sets is presented. The data set is formatted into binary bit Sequential (bSQ) format and then structured into a Peano Count tree (P-tree) format which represents a lossless tree representation of the original data. A P-tree algebra is defined and used to formulate a vertical set inner product (VSIP) technique that can be used to efficiently and scalably measure the mean value and total variation of a set about a fixed point in the large dataset. The set can be any projected subspace of any vector space, including oblique sub spaces. The VSIPs are used to determine the closeness of a point to a set of points in the large dataset making the VSIPs very useful in classification, clustering and outlier detection. One advantage is that the number of centroids (k) need not be pre-specified but are effectively determined.Type: ApplicationFiled: November 17, 2005Publication date: May 8, 2008Inventors: William K. Perrizo, Taufik Fuadi Abidin, Amal Shehan Perera, Masum Serazi
-
Patent number: 7089244Abstract: A system and method for concurrency control in high performance database systems. Generally includes receiving a database access request message from a transaction. Then, generating an element that corresponds to the access request message. The element type is that of a read element, commit element, validated element, or restart element. The element is then posted to a read-commit (RC) queue. If the element is a commit element, an intervening validation of the transaction is performed. Upon the transaction passing validation the requested database access is performed.Type: GrantFiled: May 16, 2003Date of Patent: August 8, 2006Assignee: North Dakota State UniversityInventors: Victor T. Shi, William K. Perrizo
-
Patent number: 7051028Abstract: A system and method for concurrency control in high performance database systems. Generally includes receiving a database access request message from a transaction. Then, generating an element that corresponds to the access request message. The element type is that of a read element, commit element, validated element, or restart element. The element is then posted to a read-commit (RC) queue. If the element is a commit element, an intervening validation of the transaction is performed. Upon the transaction passing validation the requested database access is performed.Type: GrantFiled: November 15, 2001Date of Patent: May 23, 2006Assignee: NDSU-Research FoundationInventors: Victor T. Shi, William K. Perrizo
-
Patent number: 6941303Abstract: A system and method to take data, which is in the form of an n-dimensional array of binary data where the binary data is comprised of bits that are identified by a bit position within the n-dimensional array, and create one file for each bit position of the binary data while maintaining the bit position identification and to store the bit with the corresponding bit position identification from the binary data within the created filed. Once this bit-sequential format of the data is achieved, the formatted data is structured into a tree format that is data-mining-ready. The formatted data is structured by dividing each of the files containing the binary data into quadrants according to the bit position identification and recording the count of 1-bits for each quadrant on a first level. Then, recursively dividing each of the quadrants into further quadrants and recording the count of 1-bits for each quadrant until all quadrants comprise a pure-1 quadrant or a pure-0 quadrant to form a basic tree structure.Type: GrantFiled: September 20, 2001Date of Patent: September 6, 2005Assignee: NDSU Research FoundationInventor: William K. Perrizo
-
Publication number: 20030236786Abstract: A system and method for concurrency control in high performance database systems. Generally includes receiving a database access request message from a transaction. Then, generating an element that corresponds to the access request message. The element type is that of a read element, commit element, validated element, or restart element. The element is then posted to a read-commit (RC) queue. If the element is a commit element, an intervening validation of the transaction is performed. Upon the transaction passing validation the requested database access is performed.Type: ApplicationFiled: May 16, 2003Publication date: December 25, 2003Applicant: North Dakota State University and North Dakota State University NDSU-Research FoudationInventors: Victor T. Shi, William K. Perrizo
-
Publication number: 20030208488Abstract: A system and method to take data, which is in the form of an n-dimensional array of binary data where the binary data is comprised of bits that are identified by a bit position within the n-dimensional array, and create one file for each bit position of the binary data while maintaining the bit position identification and to store the bit with the corresponding bit position identification from the binary data within the created filed. Once this bit-sequential format of the data is achieved, the formatted data is structured into a tree format that is data-mining-ready. The formatted data is structured by dividing each of the files containing the binary data into quadrants according to the bit position identification and recording the count of 1-bits for each quadrant on a first level. Then, recursively dividing each of the quadrants into further quadrants and recording the count of 1-bits for each quadrant until all quadrants comprise a pure-1 quadrant or a pure-0 quadrant to form a basic tree structure.Type: ApplicationFiled: February 14, 2003Publication date: November 6, 2003Applicants: North Dakota State University, NDSU-Research FoundationInventor: William K. Perrizo
-
Publication number: 20030009467Abstract: A system and method to take data, which is in the form of an n-dimensional array of binary data where the binary data is comprised of bits that are identified by a bit position within the n-dimensional array, and create one file for each bit position of the binary data while maintaining the bit position identification and to store the bit with the corresponding bit position identification from the binary data within the created filed. Once this bit-sequential format of the data is achieved, the formatted data is structured into a tree format that is data-mining-ready. The formatted data is structured by dividing each of the files containing the binary data into quadrants according to the bit position identification and recording the count of 1-bits for each quadrant on a first level. Then, recursively dividing each of the quadrants into further quadrants and recording the count of 1-bits for each quadrant until all quadrants comprise a pure-1 quadrant or a pure-0 quadrant to form a basic tree structure.Type: ApplicationFiled: September 20, 2001Publication date: January 9, 2003Inventor: William K. Perrizo
-
Publication number: 20020091717Abstract: A system and method for concurrency control in high performance database systems. Generally includes receiving a database access request message from a transaction. Then, generating an element that corresponds to the access request message. The element type is that of a read element, commit element, validated element, or restart element. The element is then posted to a read-commit (RC) queue. If the element is a commit element, an intervening validation of the transaction is performed. Upon the transaction passing validation the requested database access is performed.Type: ApplicationFiled: November 15, 2001Publication date: July 11, 2002Applicant: North Dakota State UniversityInventors: Victor T. Shi, William K. Perrizo