Data processing: artificial intelligence – Knowledge processing system – Creation or modification
Reexamination Certificate
2011-06-28
2011-06-28
Sparks, Donald (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Creation or modification
C703S002000
Reexamination Certificate
active
07970727
ABSTRACT:
A method for modeling data affinities and data structures. In one implementation, a contextual distance may be calculated between a selected data point in a data sample and a data point in a contextual set of the selected data point. The contextual set may include the selected data point and one or more data points in the neighborhood of the selected data point. The contextual distance may be the difference between the selected data point's contribution to the integrity of the geometric structure of the contextual set and the data point's contribution to the integrity of the geometric structure of the contextual set. The process may be repeated for each data point in the contextual set of the selected data point. The process may be repeated for each selected data point in the data sample. A digraph may be created using a plurality of contextual distances generated by the process.
REFERENCES:
patent: 4803736 (1989-02-01), Grossberg et al.
patent: 5313532 (1994-05-01), Harvey et al.
patent: 6334131 (2001-12-01), Chakrabarti et al.
patent: 6862586 (2005-03-01), Kreulen et al.
patent: 6904420 (2005-06-01), Shetty et al.
patent: 7024404 (2006-04-01), Gerasoulis et al.
patent: 7194483 (2007-03-01), Mohan et al.
patent: 2006/0010217 (2006-01-01), Sood
Deli Zhao; Zhouchen Lin; Xiaoou Tang; , “Contextual Distance for Data Perception,” Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on , vol., no., pp. 1-8, Oct. 14-21, 2007 doi: 10.1109/ICCV.2007.4408854 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4408854&isnumber=4408819.
de la Higuera, C.; Mico, L.; , “A contextual normalised edit distance,” Data Engineering Workshop, 2008. ICDEW 2008. IEEE 24th International Conference on , vol., no., pp. 354-361, Apr. 7-12, 2008 doi: 10.1109/ICDEW.2008.4498345 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4498345&isnumber=4498260.
Bapat, R.B. “Distance matrix and Laplacian of a tree with attached graphs”, Linear Algebra and its Applications 411 (2005) 295-308.
Agarwal, “Learning Random Walks to Rank Nodes in Graphs”, Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, 2007. pp. 1-8.
Zhou, et al., “Spectral Clustering and Transductive Learning with Multiple Views”, Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, 2007. pp. 1-8.
Bandos, et al., “Semi-supervised Hyperspectral Image Classification with Graphs”, \NEC Laboratories America (Princeton). pp. 1-4.
Minkov, et al., “Learning to Rank Typed Graph Walks: Local and Global Approaches”, Joint 9th WEBKDD and 1st SNA-KDD Workshop '07 (WebKDD/SNAKDD'07), Aug. 12, 2007, San Jose, California, USA. pp. 1-8.
Stepp, et al., “Concepts in Conceptual Clustering”Coordinated Science Laboratory University of Illinois at Urbana-Champaign., pp. 1-3.
Jonyer, et al., “Graph-Based Hierarchical Conceptual Clustering”, pp. 1-29.
Lin Zhouchen
Tang Xiaoou
Zhao Deli
Microsoft Corporation
Olude-Afolabi Ola
Sparks Donald
LandOfFree
Method for modeling data structures by creating digraphs... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for modeling data structures by creating digraphs..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for modeling data structures by creating digraphs... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2627823