Computer-implemented system and method for trustless zero-knowledge contingent payment
US-2024249280-A1 · Jul 25, 2024 · US
US2017161337A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017161337-A1 |
| Application number | US-201415325493-A |
| Country | US |
| Kind code | A1 |
| Filing date | Aug 18, 2014 |
| Priority date | Aug 18, 2014 |
| Publication date | Jun 8, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Interactive sequential pattern mining is disclosed. One example is a system including a sequence miner, and an interaction processor. A sequence database is received, the sequence database including a plurality of input sequences, where each sequence of the plurality of input sequences is an ordered list of events, and each event in the list of events includes at least one item. The sequence miner mines the sequence database for a plurality of candidate sequence patterns, the mining based on an interaction with a user. The interaction processor processes the interaction with the user, the interaction based on domain relevance of the plurality of candidate sequence patterns to the user.
Opening claim text (preview).
1 . A system comprising: a sequence database including a plurality of input sequences, wherein each sequence of the plurality of input sequences is an ordered list of events, and each event in the list of events includes at least one item; a sequence miner to mine the sequence database for a plurality of candidate sequence patterns, the mining based on an interaction with a user; and an interaction processor to process, via the processing system, the interaction with the user, the interaction based on a domain relevance of the plurality of candidate sequence patterns to the user. 2 . The system of claim 1 , wherein the interaction processor provides, to the user, an interactive visual representation of the plurality of candidate sequence patterns. 3 . The system of claim 1 , wherein the interaction processor receives, from the user, a first indication that the user is satisfied with at least one sequence pattern of the plurality of candidate sequence patterns. 4 . The system of claim 1 , wherein the interaction processor receives, from the user, a second indication that the user is not satisfied with any sequence pattern of the plurality of candidate sequence patterns. 5 . The system of claim 4 , wherein the interaction processor receives, from the user, a constraint to guide the sequence miner to mine the sequence database. 6 . The system of claim 5 , wherein the constraint is at least one of a logical constraint and a temporal constraint. 7 . The system of claim 4 , wherein: the interaction processor receives, from the user, at least one modified sequence pattern from the plurality of candidate sequence patterns; and the sequence miner mines the sequence database based on the at least one modified sequence pattern. 8 . The system of claim 1 , wherein raw input data is received via the processing system, and further including a data converter to generate the sequence database from the raw input data. 9 . The system of claim 1 , further including a ranker: to rank the plurality of candidate sequence patterns, the ranking based on a frequency of occurrence of a sequence pattern in the plurality of input sequences; and provide the ranked plurality of candidate sequence patterns to the interaction processor for the interaction with the user. 10 . The system of claim 1 , wherein a given sequence of the plurality of input sequences is associated with at least one of: a sequence identifier identifying the given sequence, an event identifier identifying a given event in the ordered list of events associated with the given sequence, an event time identifier identifying a time when the given event occurred, and an item identifier associated with the at least one item in the given event. 11 . A method to find sequential patterns in a sequence database, the method comprising: mining, via a processor, a sequence database for a plurality of candidate sequence patterns, the sequence database including a plurality of input sequences, wherein each sequence of the plurality of input sequences is an ordered list of events, and each event in the list of events includes at least one item; ranking the plurality of candidate sequence patterns, the ranking based on a frequency of occurrence of a sequence pattern in the plurality of input sequences; providing to a user, via the processor, an interactive visual representation of the ranked plurality of candidate sequence patterns; and determining a domain relevance of the plurality of candidate sequence patterns to the user, the determination based on interacting with the user via the interactive visual representation. 12 . The method of claim 11 , wherein the determining the domain relevance includes receiving, from the user, a first indication that the user is satisfied with at least one sequence pattern of the plurality of candidate sequence patterns. 13 . The method of claim 11 , wherein the determining the domain relevance includes receiving, from the user, a second indication that the user is not satisfied with any sequence pattern of the plurality of candidate sequence patterns. 14 . A non-transitory computer readable medium comprising executable instructions to: receive, via a processor, a sequence database, the sequence database including a plurality of input sequences, wherein each sequence of the plurality of input sequences is an ordered list of events, and each event in the list of events includes at least one item; mine the sequence database for a plurality of candidate sequence patterns, the instructions to mine based on an interaction with a user; rank the plurality of candidate sequence patterns, the ranking based on a frequency of occurrence of a sequence pattern in the plurality of input sequences; and process, via the processor, the interaction with the user, the interaction based on an interactive visual representation of the ranked plurality of candidate sequence patterns, and the interaction further based on domain relevance of the plurality of candidate sequence patterns to the user. 15 . The non-transitory computer readable medium of claim 14 , wherein: the instructions to process the interaction with the user include further instructions to receive a constraint from the user; and the instructions to mine include further instructions to mine the sequence database based on the constraint.
Presentation of query results · CPC title
Query processing support for facilitating data mining operations in structured databases · CPC title
Sequence data queries, e.g. querying versioned data · CPC title
Visual data mining; Browsing structured data · CPC title
using ranking · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.