![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA1&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U1Ys-NOgywfWR_9Zj1uptQzfcpV6Q&edge=0&edge=stretch&ci=127,170,733,4)
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA1&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U1Ys-NOgywfWR_9Zj1uptQzfcpV6Q&edge=0&edge=stretch&ci=760,209,51,29)
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA1&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U1Ys-NOgywfWR_9Zj1uptQzfcpV6Q&edge=0&edge=stretch&ci=760,270,51,29)
(12) UIllt€d States Patent (10) Patent N0.: US 8,108,389 B2 Bobick et al. (45) Date of Patent: Jan. 31, 2012 (54) TECHNIQUES FOR KNOWLEDGE 5,632,480 A * 5/1997 Davis et al. ................. .. 473/483 DISCOVERY BY CONSTRUCTING 5,684,985 A 11/1997 Ahmadi ....... .. 707/100 5,761,418 A * 6/1998 Francis et al. . 709/201 Egg‘C)Vl;JlFT])s(gERCrl€;El;l;/lIE;JATI0Ns USING 5,761,631 A 6/1998 Nasukawa ...................... .. 704/9 5,963,940 A 10/1999 Liddy et al. ..................... .. 707/5 . . . _ 5,985,736 A 11/1999 Orlowski et al. 438/445 A ‘ ‘ ‘ ‘ ‘ ‘ ‘ “ ‘N Carl Wlmmers Ja ISCO (MX) 6,275,817 B1 * 8/2001 Reed et al. .................... .. 706/45 (73) Assignee: Make Sence, Inc., Road ToWn, Tortola (Continued) VG ( ) FOREIGN PATENT DOCUMENTS ( * ) Notice: Subject to any disclaimer, the term of this EP 1225517 7/2002 patent is extended or adjusted under 35 (Continued) U.S.C. 154(b) by 597 days. (21) Appl. NO.Z 11/273,568 OTHER PUBLICATIONS . _ Andres et al. “Dynamic Topic Mapping Using Latent Semantic (22) Bled‘ NOV‘ 14’ 2005 Indexing”. Proceedings of the Third International Conference on (65) Prior Publication Data Information Technology andApplications. ICITA 2005. IEEE, vol. 2, J 1.4, 2005, .220-225. US 2006/0253431 A1 Nov. 9, 2006 u pp (Continued) Related U.S. Application Data (60) Provisional application No. 60/627,772, filed on Nov. Primary Examiner A Syhng Yen 12, 2004, provisional application No. 60/637,936, _ filed on Dec. 21, 2004, provisional application No. (74) Anomeyf 456"’! Or Flrm *A11en’ Dyer, DOPPe1t> 60/694,331, filed on Jun. 27, 2005. Mflbrath & Gllchnsts PA (51) Int. Cl. G06F 17/00 (2006.01) (57) ABSTRACT (52) U.S. Cl. ...... .. 707/736; 707/706; 707/722; 707/737; Techni ~ ~ ~ ~ _ _ _ _ _ ques for Identifying knoWledge use an graphical user 707/741’ 707/748’ 707/758’ 707761/891_’771056//24566’ interface for inputting one or more terms to be explored for 58 F, 1d f Cl _fi t, S h 767/104 1 additional knoWledge. Thena search is conducted across one ( ) le 737/72;ss7l3ga7l§;l 7‘;3rc7 999 005*’ or more sources of information to identify resources contain999 007’ 709’/202’ 7041/10 ’9_ 766/46’ 715/256 ing information about or information associated With said See app1'iCati’On file fOr’COmp1eté Séarch hiSt’Ory terms. The resources are decomposed into elemental units of ' information and stored in a data structures called nodes. A (56) References Cited group of nodes are stored in a node pool and, from the node
![[merged small][graphic][merged small]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA1&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U1Ys-NOgywfWR_9Zj1uptQzfcpV6Q&edge=0&edge=stretch&ci=127,843,382,71)
pool, correlations of nodes are constructed that represent knoWledge.
39 Claims, 16 Drawing Sheets
U.S. PATENT DOCUMENTS 6,466,971 B1* 10/2002 Humpleman et al. ...... .. 709/220
6,470,351 B1 10/2002 Ahmadi .............. .. . 707/102 6,529,934 B1* 3/2003 Kawamura et al. . 718/102 6,615,253 B1 9/2003 Bowman-Amuah . 709/219 6,628,314 B1 9/2003 Hoyle ....... .. . 345/854 6,633,742 B1 10/2003 Turner et al. . 434/350 6,636,865 B2 10/2003 Ahmadi .... .. . 707/102 6,654,740 B2 11/2003 Tokuda et al. . 707/500 6,766,320 B1 7/2004 Wang et al. . 707/5 6,836,768 B1 12/2004 Hirsch .. 707/3 6,879,951 B1* 4/2005 Kuo .......... .. 704/10 6,941,513 B2 9/2005 Meystelet al. . 715/256 6,986,104 B2 1/2006 Green et al. ................ .. 715/234 7,165,071 B2 1/2007 Fanning et al. ............... .. 707/10 7,249,117 B2* 7/2007 Estes ......... .. 706/52 7,269,789 B2 9/2007 Mitsugi ..... .. . 715/256 7,447,683 B2 11/2008 Quiroga etal 706/46 7,684,975 B2 3/2010 Aoki et al. .. . 704/10
2001/0056445 A1 12/2001 Meystel et al. 707/513
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA2&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U2KnBbU_qz9go7ohs6JmlK9pJpQ_w&edge=0&edge=stretch&ci=360,490,69,90)
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA2&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U2KnBbU_qz9go7ohs6JmlK9pJpQ_w&edge=0&edge=stretch&ci=405,558,24,7)
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA2&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U2KnBbU_qz9go7ohs6JmlK9pJpQ_w&edge=0&edge=stretch&ci=370,610,70,91)
![[graphic]](http://www.google.com/patents?id=MQUDAgAAEBAJ&ie=ISO-8859-1&output=text&pg=PA2&img=1&zoom=3&hl=en&q=6,411,947&cds=1&sig=ACfU3U2KnBbU_qz9go7ohs6JmlK9pJpQ_w&edge=0&edge=stretch&ci=360,731,89,265)
2002/0002450 A1 1/2002 Nunberg et al. 704/1 2002/0032740 A1 3/2002 Stern et al. . 707/206 2002/0040359 A1 4/2002 Green et al. .................... .. 707/3 2002/0052740 A1 5/2002 Charleswortl1etal. ..... .. 704/220 2002/0059220 A1* 5/2002 Little . . . . . . . . . . . . . . . . . . . . .. 707/5 2002/0083170 A1 6/2002 Collazo . 709/224 2002/0152202 A1* 10/2002 Perro et al. 707/3 2003/0028564 A1 2/2003 Sanfilippo . 707/513 2003/0050932 A1 3/2003 Pace et al. ........... .. . 707/100 2003/0126235 A1 7/2003 Chandrasekar et al. . 709/220 2003/0163302 A1 8/2003 Yin . . . . . . . . . . . . . . . . . . . . . . . .. 704/9 2004/0030741 A1* 2/2004 Wolton et al. ............... .. 709/202 2004/0117341 A1 6/2004 Varadarajan .................... .. 707/1 2004/0123233 A1 6/2004 Cleary ...... .. . 715/513 2004/0163043 A1 8/2004 Baudin et al. . 715/513 2004/0169683 A1 9/2004 Chiu et al. .. . 345/776 2004/0172389 A1 9/2004 Galaiet al. . . . . . . . . .. 707/3 2004/0183837 A1 9/2004 Watanabe et al. .. . 345/853 2004/0193520 A1 9/2004 LaComb et al. 705/35 2004/0205670 A1 10/2004 Mitsugi ........ .. . 715/531 2004/0254904 A1 12/2004 Nelken et al. ................. .. 706/50 2005/0086212 A1 4/2005 Hughes et al. .................. .. 707/3 2005/0108001 A1 5/2005 Aarskog 704/10 2005/0132070 A1 6/2005 Redlich et al. . 709/228 2005/0154690 A1* 7/2005 Nitta et al. .. 706/46 2005/0187866 A1* 8/2005 Lee ........ .. 705/39 2005/0193029 A1 9/2005 Rom et al. . 707/200 2005/0234894 A1* 10/2005 Tenazas 707/3 2005/0246358 A1 11/2005 Gross ........ .. . 707/100 2005/0267871 A1 12/2005 Marchisio et al. . 707/3 2005/0283369 A1 12/2005 Clausner et al. . 704/275 2005/0288920 A1 12/2005 Green et al. 707/3 2005/0289168 A1 12/2005 Green et al. . 707/101 2006/0062470 A1 3/2006 Zhu et al. . 382/186 2006/0080338 A1 4/2006 Seubert et al. . . 707/100 2006/0136295 A1 6/2006 Bobick et al. .. 705/14 2006/0167931 A1 7/2006 Bobick et al. . 707/102 2006/0242130 A1 10/2006 Sadriet al. .. 707/3 2007/0005566 A1 1/2007 Bobick et al. .. .. 707/2 2007/0174149 A1 7/2007 Dinger et al. 705/28 2007/0192319 A1 8/2007 Finley et al. . . . . . . . . . . .. 707/7 2008/0005651 A1 1/2008 Grefenstette et al. . 715/500 2008/0021701 A1 1/2008 Bobick et al. ................... .. 704/9 FOREIGN PATENT DOCUMENTS
JP 4-252375 9/1992
JP 10-124522 5/1998
JP 2000112938 4/2000
JP 2003228580 8/2003
JP 2004021763 1/2004
JP 2005258659 9/2005
WO WO01/67280 9/2001
WO WO03/056467 7/2003
WO WO2006/053306 5/2006
OTHER PUBLICATIONS
Almpanidis et al. “Focused Crawling Using Latent Semantic Indexing-An Application For Vertical Search Engines”. Research and
Advanced Technology For Digital Libraries Lecture Notes in Computer Science; LNCS, Spinger, Berlin, DE, vol. 3652, Jan. 1, 2005, pp. 402-413.
Benjamin C. Hachey, “Recognising Clauses Using Symbolic and Machine Learning Approaches”, University of Edinburgh, Sep. 2002, 94 pages.
Kelledy, F., Smeaton, A.F., “Automatic Phrase Recognition and Extraction from Text”, Proceedings of the 19”’ Annual BCS-IRSG Colloquium on IR Research, 1997, 9 pages.
Chen, K., “Topic Identification in Discourse”, Morgan Kaufman, 1995, 5 pages.
“WebSphere Business Integration Adapter Framework”. Found at http://www-01 .ibm.corn/ software/ integration/wbiadapters/ framework. Date unknown.
Joshua Bloch, “Trial:Collections”. The JavaTM Tutorial. Found at http://java.sun.com/docs/books/tutorial/collections. Copyright 1995-2005 Sun Microsystems, Inc.
“Python for NLP and the Natural Language Toolkit” CS1576: AI Application Development, (modified from Edward Loper’s notes), Spring 2003. Found at http://www.cs.pitt.edu/~litman/courses/ cs1573s03/lec/nltk.ppt.
Editor Dave Beckett. “RDF/XML Syntax Specification (Revised)”, W3C Recommendation Feb. 10, 2004. Found at http://wwvv.w3 .org/ TIU2004/REC-rdf-syntax-grammar-20040210/. Copyright 2004 W3C® (MIT,ERCIM,Keio).
Lattner et al. “Automatic Pool Allocation for Disjoint Data Structures”. ACM SIGPLAN Workshop on Memory System Performance (MSP2002), Jun. 16, 2002. Found at http://llvm.cs.uiuc.edu/pubs/ 2002-06-AutomaticPoolAllocation.ppt.
“Relational Database System Concepts” Penn Computing, Information Systems and Computing, University of Pennsylvania. Found at http://www.upenn.edu/computing/da/dw/concepts.htrnl. Dec. 2001. “An Introduction to Java Map Collection Classes”. Found at http:// www.tl1eserverside.Com/news/thread.tss?threadiid:28777. 2004. G. Veda, “Personal Information Systems”, Dept. of Computer Science & Engineering, Indian Institute of Technology, Kanpur, UP, Indiai208016. Found at http://www.cse.iitk.ac.in/report-repository/2005/btp.pdf. May 2, 2005.
Eric W. Weisstein. “Acyclic Digraph”, from MathWorldiA Wolfram Web Resource. © 1999-2005 Wolfram Research, Inc. Found at http://matl1world.wolfram.corn/AcyclicDigraph.htrnl.
“Directed Acyclic Graph”, from Wikipedia. Found at http://en. wikipedia.org/wiki/Directediacyclicigraph. Jun. 19, 2005.
“ICS 161: Design and Analysis of AlgorithmsiLecture notes for Feb. 8, 1996”. ICS 161iDept. Information & Computer Science, UC Irvine. Found at http://www.ics.uci.edu/-eppstein/161/960208. html. May 2, 2000.
“Link Analysis: Why is it fundamental to search engine optimization?” Found at http://www.oyster-web.co.uldlink-analysis/linkanalisys.htrnl. © 2005 Indicium Web Design UK.
Ziv Bar-Yossef. “Algorithms for Large Data Sets”. Lecture 3. Found at http://www.ee.technion.ac.il/courses/049011. Mar. 23, 2005. “SVM Application List”. Found at http://www.kernel-machines.orq/ links/isabelle-guyons-svm-application-list/. Jun. 20, 2005. “Glossary of Graph Theory”. Found at http://encyclopedia. laborlawtalk.com/Glossaryiofigraphitheory. Date Unknown. “jmbox Project Home”. Found at https://jmbox.dev.java.net/. © 1995-2007 CollabNet.
Eric W. Weisstein. “Web Graph”, from MathWorldiA Wolfram Web Resource. Found at http://matl1world.wolfram.corr1/WebGraph.html. © 1999 CRC Press LLC, Wolfram Research, Inc, © 1999-2005 Wolfram Research, Inc.
Office Action dated Nov. 29, 2010 for U.S. Appl. No. 11/426,932. Office Action dated Mar. 24, 2011 for U.S. Appl. No. 11/314,835. Office Action dated Sep. 16, 2010 for U.S. Appl. No. 11/427,600. Notice of Allowance dated Mar. 24, 2011 for U.S. Appl. No. 1 1/761,839.
U.S. Appl. No. 11/427,600, filed June. 2006, Bobick et al.
a§_m_=e S at $35.. Ez§_e E§§E=_ §.== E =2=§_=§= + 5 E P =<>E~_+=§ § 2 m m S &V §==§_" if m§_=§=<>E~_ gs >_=2§E fi_m_=~__E~_ . ===<§=_s >~_o=8._m=_ :55 2 _ mms=_._ §§E §_<_§_§ JI ..=Q=<E=.. H §E > .2? H E: X
011001 6SI 10011 1101111111s10 m 151 11111 1101111111110) 1101111111310 [51 $1 E|(l0N 5300" 11101011) I ______________ _- Jss11s11 _ _____ __1— "Isl E 11o111n0ss1 am 1 l—| 1 112511511 1 Z M 3 T I 1"‘ NOIIVDOSSV ‘---*—(1) I I 1—. —- 0151 I I 11011111111 ; 1 _ -011101110111-1101111 I I -- GED " ' 1 I111‘ ” 0151 - . (J1s1)(|11s1)( 1191 ) = 1101111111 151 -011101110111-1101131 SSINOIIVWOJ 1001111101110 "1V""V1$'$1'°l°9 6SI1fl0N 110111111510 091 0o|111w 1101111111110)
|
