Method for capturing local and evolving clusters

Data processing: measuring – calibrating – or testing – Measurement system – Measured signal processing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C702S033000

Reexamination Certificate

active

07885791

ABSTRACT:
The present invention provides a method of detecting the growth and development of clusters in a data set. The data set is divided into a number of slices and an algorithm is applied to the data held in each data slice set. Each slice can be compared with the subsequent slice to determine which clusters persist from slice to slice. Random data agglomerations in a single slice may give the appearance of a cluster but their random nature means that they are unlikely to persist so those clusters that persist across a number of slices, or that show the strongest measure of persistence, are most likely to represent a data cluster that represents a situation of interest.

REFERENCES:
patent: 2883255 (1959-04-01), Anderson
patent: 6026397 (2000-02-01), Sheppard
patent: 6446021 (2002-09-01), Schaeffer
patent: 6797526 (2004-09-01), Tanaka et al.
patent: 6841403 (2005-01-01), Tanaka et al.
patent: 6944607 (2005-09-01), Zhang et al.
patent: 6965831 (2005-11-01), Domany et al.
patent: 7043500 (2006-05-01), Leary
patent: 7167811 (2007-01-01), Tabor
patent: 7437271 (2008-10-01), Tabor
patent: 7599933 (2009-10-01), Domany et al.
patent: 2003/0009470 (2003-01-01), Leary
patent: 2003/0054573 (2003-03-01), Tanaka et al.
patent: 2003/0059818 (2003-03-01), Domany et al.
patent: 2003/0138978 (2003-07-01), Tanaka et al.
patent: 2003/0144810 (2003-07-01), Tabor
patent: 2005/0240563 (2005-10-01), Domany et al.
patent: 2007/0022065 (2007-01-01), Hatano et al.
patent: 2007/0179743 (2007-08-01), Tabor
patent: 2008/0243817 (2008-10-01), Chan et al.
Zhang et al., “BIRCH: An Efficient Data Clustering Method for Very large”, SIGMOD '96 Jun. 1996 Montreal, Canada.
Kalnis et al., “On Discovering Moving Clusters in Spatio-Temporal”, Proc. 9THInt. Conf. Scientific and Statistical Database Management, vol. 3633 of LINCS, pp. 236-253, 2005.
Topchy et al., “Adaptive Clustering Ensembles”, circa 2004.
Kriegel et al., “:Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering”, circa 1998.
Ghosh et al., “A Consensus Framework for Integrating Distributed Clusterings Under Limited Knowledge Sharing”, circa 2000.
Guha et al., “Clustering Data Streams”, pp. 1-8, circa 1998.
Li et al., “Clustering Moving Objects”, Proc. 10THACM SIGKDD Int. Conf on Knowl. Discovery and Data Mining, pp. 617-622, 2004.
Ankerst et al., “OPTICS:Ordering Points to Identify the Clustering Structure”, Proc. ACM SIGMOD '99 Int. Conf. on Management of Data, Philadelphia, PA, 1999, pp. 49-60.
Siliopoulou et al., “MONIC—Modelling and Monitoring Cluster Transitions”, Research Track Poster, KDD '06, Aug. 20-23, 2006, Philadelphia, PA, USA.
Aggarwal, et al., “A Framework for Clustering Evolving Data Streams”, Proc. 29THInt. Conf. On Very Large Databases, pp. 81-82, 2003.
Brecheisen, S., et al. “Visually Mining Through Cluster Hierarchies”; Institute for Computer Science, University of Munich; circa 2003.
Munkres, J., “Algorithms for the Assignment and Transportation Problems”; J. Soc. Indust. Appl. Math., vol. 5, No. 1, Mar. 1957.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for capturing local and evolving clusters 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 capturing local and evolving clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for capturing local and evolving clusters will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2635333

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.