Fast-approximate TFIDF

Details Fast-approximate TFIDF Fast-approximate TFIDF

2008-09-12

2010-06-01

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Database and file access

Post processing of search results

C705S001100

Reexamination Certificate

active

07730061

ABSTRACT:
Our approach seeks to reduce the complexity of this type of calculation through approximation and pre-computation. It is designed to work efficiently with modern relational database constructs for content management. The approach is designed to enable the kinds of highly interactive data-driven visualizations that are the hallmark of third generation business intelligence.

REFERENCES:
patent: 5263159 (1993-11-01), Mitsui
patent: 5621454 (1997-04-01), Ellis et al.
patent: 5675819 (1997-10-01), Schuetze
patent: 6006221 (1999-12-01), Liddy et al.
patent: 6233575 (2001-05-01), Agrawal et al.
patent: 6499030 (2002-12-01), Igata
patent: 6564210 (2003-05-01), Korda et al.
patent: 6970863 (2005-11-01), Cragun et al.
patent: 7146356 (2006-12-01), Choi et al.
patent: 7219090 (2007-05-01), Travis, Jr.
patent: 7251637 (2007-07-01), Caid et al.
patent: 7302646 (2007-11-01), Nomiyama et al.
patent: 7392262 (2008-06-01), Alspector et al.
patent: 2002/0065957 (2002-05-01), Rubin
patent: 2002/0072895 (2002-06-01), Imanaka et al.
patent: 2002/0103809 (2002-08-01), Starzl et al.
patent: 2002/0165873 (2002-11-01), Kwok et al.
patent: 2002/0174101 (2002-11-01), Fernley et al.
patent: 2003/0014405 (2003-01-01), Shapiro et al.
patent: 2003/0033287 (2003-02-01), Shanahan et al.
patent: 2003/0061025 (2003-03-01), Abir
patent: 2003/0172058 (2003-09-01), Namba
patent: 2004/0064447 (2004-04-01), Simske et al.
patent: 2004/0186826 (2004-09-01), Choi et al.
patent: 2005/0010560 (2005-01-01), Altevogt et al.
patent: 2005/0086254 (2005-04-01), Zou et al.
patent: 2005/0198076 (2005-09-01), Stata et al.
patent: 2005/0262050 (2005-11-01), Fagin et al.
patent: 2005/0278314 (2005-12-01), Buchheit
patent: 2006/0106767 (2006-05-01), Adcock et al.
patent: 2007/0016574 (2007-01-01), Carmel et al.
patent: 2007/0074131 (2007-03-01), Assadollahi
patent: 2007/0185858 (2007-08-01), Lu et al.
patent: 2007/0185871 (2007-08-01), Canright et al.
patent: 2007/0192293 (2007-08-01), Swen
patent: 2007/0244915 (2007-10-01), Cha et al.
patent: 2007/0294220 (2007-12-01), Tabraham
patent: 2008/0005651 (2008-01-01), Grefenstette et al.
patent: 2008/0015844 (2008-01-01), Fux et al.
patent: 2008/0027918 (2008-01-01), Altevogt et al.
patent: 2009/0028441 (2009-01-01), Milo et al.
patent: 2009/0138466 (2009-05-01), Henry et al.
patent: 2006244294 (2006-09-01), None
Kushal Dave, Steve Lawrence and David M. Pennock, “Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews”, May 24, 2003.
Petr Kroha and Ricardo Baeza-Yates, “A Case Study: News Classification Based on Term Frequency”, 2005.
Natalia Kozlowa, “Automatic ontology extraction for document classification”, Feb. 2005.
Lee, Dik Lun, et al., “Document Ranking on Weight-Partitioned Signature Files”, ACM Transactions on Information Systems, 1996, vol. 14, No. 2, pp. 109-137.
Robertson, S.E., et al., “Okapi/Keenbow at TREC-8”, pp. 1-11.
Dubinko, Michah, et al., “Visualizing Tags Over Time”, WWW 2006, May 23-26, 2006, Edinburgh, Scotland, pp. 1-10, World Wide Web Conference Committee (IW3C2).
Vlajic, N., et al., “Categorizing Web Pages on the Subject of Neural Networks”, Internet Innovation Centre, Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada, pp. 1-11.

Affiliated with

Also associated with

Rating

Fast-approximate TFIDF does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast-approximate TFIDF, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast-approximate TFIDF will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4235635