Efficient recursive clustering based on a splitting function...

Data processing: speech signal processing – linguistics – language – Speech signal processing – Recognition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C704S240000, C704S249000, C704S255000, C704S272000

Reexamination Certificate

active

07472062

ABSTRACT:
Methods and arrangements for facilitating data clustering. From a set of input data, a predetermined number of non-overlapping subsets are created. The input data is split recursively to create the subsets.

REFERENCES:
patent: 5263120 (1993-11-01), Bickel
patent: 5659662 (1997-08-01), Wilcox et al.
patent: 5710833 (1998-01-01), Moghaddam et al.
patent: 5862519 (1999-01-01), Sharma et al.
patent: 6058205 (2000-05-01), Bahl et al.
patent: 6064958 (2000-05-01), Takahashi et al.
patent: 6073096 (2000-06-01), Gao et al.
patent: 6253179 (2001-06-01), Beigi et al.
patent: 6272449 (2001-08-01), Passera
patent: 6343267 (2002-01-01), Kuhn et al.
patent: 6442519 (2002-08-01), Kanevsky et al.
patent: 2003/0046253 (2003-03-01), Shetty et al.
patent: 2003/0224344 (2003-12-01), Shamir et al.
Y. Linde et al., “An Algorithm for Vector Quantizer Design”, IEEE Trans. Communication, vol. 28, pp. 84-95, Jan. 1980.
U.V. Chaudhari et al., “Transformation Enhanced Multi-Grained Modeling for Text-Independent Speaker Recognition”, ICSLP 2000, pp. II-298-II-301.

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

Efficient recursive clustering based on a splitting function... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient recursive clustering based on a splitting function..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient recursive clustering based on a splitting function... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4035004

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