IP Library Granted Patent US 12,380,165
Granted Patent B2
US 12,380,165 · App. 18/588,974 · Granted Aug 5, 2025

Bulletin board data mapping and presentation

Inventors: Carl Mandel (Toronto, CA); David Mandel (Toronto, CA); Brian Fudge (Del Mar, CA); Lew Roth (Santa Monica, CA); Kevin Watters (Boston, MA)
Assignee: Bitvore Corp.
G06F16/9024G06F16/2228G06F16/2365G06F16/24578G06F16/248G06F16/9535G06Q10/107H04L51/216
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,380,165
App. No.
18/588,974
Granted
Aug 5, 2025
Kind
B2
Abstract

The system provides a method and apparatus for sorting and displaying information from a BBS. The system provides a method of sorting and presenting messages from a BBS in a way so that the relationship in message threads can be easily observed and related messages can be identified. The system provides a way to view messages and map message threads in two and three dimensions so that the content of messages can be easily reviewed and the relationship between messages can be seen and followed. The system allows a user to enter into a message thread at any point and to then produce a visualization of the related threads and messages associated with each individual message. The system provides interfaces for either a linear or threaded BBS or even a hybrid BBS that is some combination of linear and threaded.

Claims (48)

1. A method comprising:

storing a first search request and one or more prior search requests in a first session corresponding to a first area of research;

performing a second search of data in a system according to a second search request, to determine a second set of search results comprising one or more records that are relevant to the second search request;

weighting the second set of search results according to a weighting metric;

sorting the second set of search results by weight;

storing the second search request in a second session;

generating a user interface configured to display a tag cloud representing a plurality of terms within a dataset, wherein the tag cloud visually adjusts the size and/or prominence of each term according to user-defined boosting criteria; and

configuring a search modification module to enable a user to modify an active search query by selecting a term in the tag cloud and cycling through search operators comprising one or more of OR, AND, and EXCLUDE, via successive user interactions with the term.

2. The method of claim 1 , wherein the method comprises:

receiving the first search request corresponding to the first area of research; and

performing a search of the data in the system according to the first search request to determine a first set of search results comprising one or more records.

3. The method of claim 1 , wherein the method comprises:

determining whether the one or more prior search requests were received prior to the first search request, wherein the one or more prior search requests comprise one or more additional search terms no in the first search request; and

upon determining that one or more prior search requests were received, weighting one or more records of a first set of search results according to a weighting metric relative to the one or more additional search terms.

4. The method of claim 1 , wherein the data in the system is searched according to adaptive relevancy.

5. The method of claim 4 , wherein the adaptive relevancy comprises term frequency, inverse document frequency, relevancy, whether a term is out of context, freshness of news, distance to result, and a proximity of the search terms.

6. The method of claim 1 , wherein the data in the system is searched according to a relevancy model.

7. The method of claim 1 , wherein the weighting metric comprises one or more of field length normalization, field boosting, temporal relevance, and a proximity of the search terms.

8. The method of claim 1 , wherein:

the weighting metric is determined according to a relevancy score, and

the relevancy score is determined according to a proximity of search terms in a search request.

9. The method of claim 1 , wherein the sorting is performed according to a relevance of the one or more records to search terms and the weighting metric.

10. The method of claim 1 , wherein the method comprises storing a set of one or more search terms, corresponding to an area of research, to a database.

11. A system comprising:

memory operable to:

store a first search request and one or more prior search requests in a first session corresponding to a first area of research, and

store a second search request in a second session; and

one or more processors operable to:

perform a second search of data in a system according to the second search request, to determine a second set of search results comprising one or more records that are relevant to the second search request,

weight the second set of search results according to a weighting metric,

sort the second set of search results by weight,

generate a user interface configured to display a tag cloud representing a plurality of terms within a dataset, wherein the tag cloud visually adjusts the size and/or prominence of each term according to user-defined boosting criteria, and

configure a search modification module to enable a user to modify an active search query by selecting a term in the tag cloud and cycling through search operators comprising one or more of OR, AND, and EXCLUDE, via successive user interactions with the term.

12. The system of claim 11 , wherein the one or more processors are operable to:

receive the first search request corresponding to the first area of research, and

perform a search of the data in the system according to the first search request to determine a first set of search results comprising one or more records.

13. The system of claim 11 , wherein the one or more processors are operable to:

determine whether the one or more prior search requests were received prior to the first search request, wherein the one or more prior search requests comprise one or more additional search terms no in the first search request, and

upon determining that one or more prior search requests were received, weight one or more records of a first set of search results according to a weighting metric relative to the one or more additional search terms.

14. The system of claim 11 , wherein the one or more processors are operable to search the data in the system according to adaptive relevancy.

15. The system of claim 14 , wherein the adaptive relevancy comprises term frequency, inverse document frequency, relevancy, whether a term is out of context, freshness of news, distance to result, and a proximity of the search terms.

16. The system of claim 11 , wherein the one or more processors are operable to search the data in the system according to a relevancy model.

17. The system of claim 11 , wherein the weighting metric comprises one or more of field length normalization, field boosting, temporal relevance, and a proximity of the search terms.

18. The system of claim 11 , wherein:

the weighting metric is determined according to a relevancy score, and

the relevancy score is determined according to a proximity of search terms in a search request.

19. The system of claim 11 , wherein the one or more processors are operable to sort according to a relevance of the one or more records to search terms and the weighting metric.

20. The system of claim 11 , wherein the memory is operable to store a set of one or more search terms, corresponding to an area of research, to a database.

Assignments (2)
SECURITY INTEREST Recorded Nov 21, 2024
From: BITVORE CORP.
To: MCANDREWS, HELD & MALLOY LTD.
Reel/Frame 069432/0283 →
SECURITY INTEREST Recorded Nov 21, 2024
From: BITVORE CORP.
To: MCANDREWS, HELD & MALLOY LTD.
Reel/Frame 070070/0141 →
Continuity (5)
Continuation 18093024 · Jan 4, 2023
Continuation 14678762 · Apr 3, 2015
Continuation 13214053 · Aug 19, 2011
Provisional Application 61375414 · Aug 20, 2010
Related Publication 20240211514A1 · Jun 27, 2024
References Cited (28)
US 6212521B1 · Minami et al. · 2001 [cited by applicant]
US 7159011B1 · Knight et al. · 2007 [cited by applicant]
US 7698270B2 · Brave et al. · 2010 [cited by applicant]
US 7917483B2 · Chang · 2011 [cited by applicant]
US 8176044B2 · Edala et al. · 2012 [cited by applicant]
US 8429220B2 · Wilkinson · 2013 [cited by examiner]
US 8489641B1 · Seefeld · 2013 [cited by examiner]
US 20040061716A1 · Cheung et al. · 2004 [cited by applicant]
US 20050055405A1 · Kaminsky et al. · 2005 [cited by applicant]
US 20060149606A1 · Goan et al. · 2006 [cited by applicant]
US 20060259481A1 · Handley · 2006 [cited by applicant]
US 20070005587A1 · Johnson et al. · 2007 [cited by applicant]
US 20070022169A1 · Suzuki et al. · 2007 [cited by applicant]
US 20080126308A1 · Wooldridge et al. · 2008 [cited by applicant]
US 20080189269A1 · Olsen · 2008 [cited by examiner]
US 20090049038A1 · Gross · 2009 [cited by applicant]
US 20090125498A1 · Cao et al. · 2009 [cited by applicant]
US 20090235084A1 · Ferraro et al. · 2009 [cited by applicant]
US 20090240680A1 · Tankovich et al. · 2009 [cited by applicant]
US 20090292696A1 · Shuster · 2009 [cited by examiner]
US 20100005087A1 · Basco et al. · 2010 [cited by applicant]
US 20100070880A1 · Chinta · 2010 [cited by applicant]
US 20100174710A1 · Carson, Jr. et al. · 2010 [cited by applicant]
US 20100220008A1 · Conover et al. · 2010 [cited by applicant]
US 20100281113A1 · Laine et al. · 2010 [cited by applicant]
AU 2008254644 · 2008 [cited by applicant]
Int'l Search Report and Written Opinion AppIn No. PCT/US2011/048512 mailed Jan. 5, 2012. [cited by applicant]
Int'l Preliminary Report on Patentability AppIn No. PCT/US2011/048512 mailed Mar. 7, 2013. [cited by applicant]