公开(公告)号：US08868480B2

公开(公告)日：2014-10-21

申请号：US13534930

申请日：2012-06-27

Applicant: Jason McBride ,  Thomas J. Sullivan ,  Michael Swinson ,  Zixia Wang

Inventor： Jason McBride ,  Thomas J. Sullivan ,  Michael Swinson ,  Zixia Wang

IPC: G06Q30/08 ,  G06Q30/06 ,  G06Q30/02 ,  G06N5/02

CPC classification number: G06Q30/0629 ,  G06N5/02 ,  G06Q30/0202 ,  G06Q30/0254 ,  G06Q30/0601 ,  G06Q30/08

Abstract: Embodiments disclosed herein provide systems and methods for the filtering, selection and presentation of vendors accounting for both user characteristics and vendor characteristics, such that the systems and methods may be used by both customer and vendor alike to better match customer needs with the resource-constrained vendors with whom a successful sale has a higher probability of occurring. Embodiments may include filtering, selecting and/or presenting vendors to a user sorted by the probability that the particular vendor will possess the characteristics that appeal to a particular customer and therefore result in a large probability of sale and suppress presentation of those vendors that are unlikely to be selected by the customer since their characteristics are less consistent with those needed by the customer and, therefore, are unlikely to result in a sale.

Abstract translation: 本文公开的实施例提供了用于对用户特征和供应商特征两者进行过滤，选择和呈现的系统和方法，使得客户和供应商都可以使用这些系统和方法来更好地将客户需求与资源受限 成功销售的供应商的发生概率较高。 实施例可以包括过滤，选择和/或向用户呈现供应商，其按照特定供应商将具有吸引特定客户的特征的概率来排序，因此导致销售的可能性很大并且抑制那些不太可能的供应商的展示 由客户选择，因为它们的特征与客户所需的特征不一致，因此不太可能导致销售。

公开(公告)号：US20130117067A1

公开(公告)日：2013-05-09

申请号：US13291544

申请日：2011-11-08

Applicant: Thomas J. Sullivan ,  Isaac Lemon Laughlin ,  Tyson Fritz Nassauer ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Isaac Lemon Laughlin ,  Tyson Fritz Nassauer ,  Michael Swinson

IPC: G06Q30/02

CPC classification number: G06Q30/0202 ,  G06Q10/06398

Abstract: In embodiments disclosed herein, a computer may operate to determine, for each member in a set and each non-member under consideration for the set, an expected revenue to be passed to a parent organization. The expected revenue may be determined utilizing a plurality of weighted features. Members in the set may be ranked according to their expected revenues. Top performing members in the set may be protected to ensure their expected revenues. Bottom performing members may be removed from the set and/or replaced with new members outside of geographical protective areas of the top performing members. The optimization process can be repeated until the set of members can satisfy an existing demand while maximizing revenue for the parent organization.

Abstract translation: 在本文公开的实施例中，计算机可以操作以针对集合中的每个成员以及正在考虑的集合中的每个非成员确定要传递给母组织的预期收入。 可以利用多个加权特征来确定预期收入。 集团成员可按其预期收入排名。 该集团中表现最佳的成员可能受到保护，以确保其预期收入。 底层表演成员可以从组中移除和/或替换为最高成绩成员的地理保护区域之外的新成员。 可以重复优化过程，直到该组成员能够满足现有需求，同时最大化上级组织的收入。

公开(公告)号：US10296929B2

公开(公告)日：2019-05-21

申请号：US13173357

申请日：2011-06-30

Applicant: Michael Swinson ,  Param Pash Kaur Dhillon ,  Thomas J. Sullivan ,  Xingchu Liu

Inventor： Michael Swinson ,  Param Pash Kaur Dhillon ,  Thomas J. Sullivan ,  Xingchu Liu

IPC: G06Q30/02

Abstract: Disclosed are embodiments for the aggregation and analysis of vehicle prices via a geo-specific model. Data may be collected at various geo-specific levels such as a ZIP-Code level to provide greater data resolution. Data sets taken into account may include demarcation point data sets and data sets based on vehicle transactions. A demarcation point data set may be based on consumer market factors that influence car-buying behavior. Vehicle transactions may be classified into data sets for other vehicles having similar characteristics to the vehicle. A geo-specific statistical pricing model may then be applied to the data sets based on similar characteristics to a particular vehicle to produce a price estimation for the vehicle.

公开(公告)号：US08661403B2

公开(公告)日：2014-02-25

申请号：US13173332

申请日：2011-06-30

Applicant: Thomas J. Sullivan ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Michael Swinson

IPC: G06F9/44 ,  G06F7/00

CPC classification number: G06Q30/0201 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/3053 ,  G06F17/30867 ,  G06N5/04 ,  G06Q30/0202

Abstract: Embodiments disclosed provide a system, method, and computer program product for identifying consumer items more likely to be bought by an individual user. In some embodiments, a collaborative filter may be used to rank items based on the degree to which they match user preferences. The collaborative filter may be hierarchical and may take various factors into consideration. Example factors may include the similarity among items based on observable features, a summary of aggregate online search behavior across multiple users, the item features determined to be most important to the individual user, and a baseline item against which a conditional probability of another item being selected is measured.

Abstract translation: 所公开的实施例提供了用于识别更可能由单个用户购买的消费品的系统，方法和计算机程序产品。 在一些实施例中，可以使用协作过滤器来基于他们与用户偏好匹配的程度对项目进行排名。 协同过滤器可以是分层的，并且可以考虑各种因素。 示例性因素可以包括基于可观察特征的项目之间的相似性，跨多个用户的聚合在线搜索行为的总结，被确定为对于个体用户最重要的项目特征以及另一项目的条件概率为 选择被测量。

公开(公告)号：US08661020B2

公开(公告)日：2014-02-25

申请号：US13360981

申请日：2012-01-30

Applicant: Thomas J. Sullivan ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Michael Swinson

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F11/0739 ,  G06K9/6282 ,  G06K9/6878 ,  G06K2209/23

Abstract: A vehicle identification number (VIN) decoder (VDC) implementing a unique VIN decoding method may, for a given VIN, shorten the VIN and form a stem and a leaf therefrom. Utilizing the stem, the VDC may operate to find matching leaf values, if any, from a set of look up tables. Depending upon a match outcome, one or more trim identification code (TIC) values can be assigned to the VIN and a candidate list can be constructed utilizing the assigned TIC value(s). The candidate list, which can be optimized, may contain one or more candidate trims for the VIN. For each candidate trim, a confidence score and match probability can be generated. The VDC may provide decoded information containing trim data associated with at least one of the one or more candidate trims for the VIN to a client device over a network connection.

Abstract translation: 对于给定的VIN，实现唯一VIN解码方法的车辆识别号（VIN）解码器（VDC）可以缩短VIN并从其形成杆和叶。 利用茎杆，VDC可以操作以从一组查询表中找到匹配的叶子值（如果有的话）。 根据匹配结果，可以将一个或多个修剪识别码（TIC）值分配给VIN，并且可以使用所分配的TIC值构建候选列表。 可以优化的候选列表可能包含VIN的一个或多个候选修剪。 对于每个候选修剪，可以生成置信度分数和匹配概率。 VDC可以通过网络连接向客户端设备提供包含与VIN的一个或多个候选修剪中的至少一个相关联的修剪数据的解码信息。

公开(公告)号：US20130198167A1

公开(公告)日：2013-08-01

申请号：US13360981

申请日：2012-01-30

Applicant: Thomas J. Sullivan ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Michael Swinson

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F11/0739 ,  G06K9/6282 ,  G06K9/6878 ,  G06K2209/23

Abstract: A vehicle identification number (VIN) decoder (VDC) implementing a unique VIN decoding method may, for a given VIN, shorten the VIN and form a stem and a leaf therefrom. Utilizing the stem, the VDC may operate to find matching leaf values, if any, from a set of look up tables. Depending upon a match outcome, one or more trim identification code (TIC) values can be assigned to the VIN and a candidate list can be constructed utilizing the assigned TIC value(s). The candidate list, which can be optimized, may contain one or more candidate trims for the VIN. For each candidate trim, a confidence score and match probability can be generated. The VDC may provide decoded information containing trim data associated with at least one of the one or more candidate trims for the VIN to a client device over a network connection.

Abstract translation: 对于给定的VIN，实现唯一VIN解码方法的车辆识别号（VIN）解码器（VDC）可以缩短VIN并从其形成杆和叶。 利用茎杆，VDC可以操作以从一组查询表中找到匹配的叶子值（如果有的话）。 根据匹配结果，可以将一个或多个修剪识别码（TIC）值分配给VIN，并且可以使用所分配的TIC值构建候选列表。 可以优化的候选列表可能包含VIN的一个或多个候选修剪。 对于每个候选修剪，可以生成置信度分数和匹配概率。 VDC可以通过网络连接向客户端设备提供包含与VIN的一个或多个候选修剪中的至少一个相关联的修剪数据的解码信息。

公开(公告)号：US20130007705A1

公开(公告)日：2013-01-03

申请号：US13173332

申请日：2011-06-30

Applicant: Thomas J. Sullivan ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Michael Swinson

IPC: G06F9/44 ,  G06F9/45

CPC classification number: G06Q30/0201 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/3053 ,  G06F17/30867 ,  G06N5/04 ,  G06Q30/0202

Abstract: Embodiments disclosed provide a system, method, and computer program product for identifying consumer items more likely to be bought by an individual user. In some embodiments, a collaborative filter may be used to rank items based on the degree to which they match user preferences. The collaborative filter may be hierarchical and may take various factors into consideration. Example factors may include the similarity among items based on observable features, a summary of aggregate online search behavior across multiple users, the item features determined to be most important to the individual user, and a baseline item against which a conditional probability of another item being selected is measured.

Abstract translation: 所公开的实施例提供了用于识别更可能由单个用户购买的消费品的系统，方法和计算机程序产品。 在一些实施例中，可以使用协作过滤器来基于他们与用户偏好匹配的程度对项目进行排名。 协同过滤器可以是分层的，并且可以考虑各种因素。 示例性因素可以包括基于可观察特征的项目之间的相似性，跨多个用户的聚合在线搜索行为的总结，被确定为对于个体用户最重要的项目特征以及另一项目的条件概率为 选择被测量。

公开(公告)号：US20130006916A1

公开(公告)日：2013-01-03

申请号：US13534930

申请日：2012-06-27

Applicant: Jason McBride ,  Thomas J. Sullivan ,  Michael Swinson ,  Zixia Wang

Inventor： Jason McBride ,  Thomas J. Sullivan ,  Michael Swinson ,  Zixia Wang

IPC: G06Q30/00 ,  G06N5/02

CPC classification number: G06Q30/0629 ,  G06N5/02 ,  G06Q30/0202 ,  G06Q30/0254 ,  G06Q30/0601 ,  G06Q30/08

Abstract: Embodiments disclosed herein provide systems and methods for the filtering, selection and presentation of vendors accounting for both user characteristics and vendor characteristics, such that the systems and methods may be used by both customer and vendor alike to better match customer needs with the resource-constrained vendors with whom a successful sale has a higher probability of occurring. Embodiments may include filtering, selecting and/or presenting vendors to a user sorted by the probability that the particular vendor will possess the characteristics that appeal to a particular customer and therefore result in a large probability of sale and suppress presentation of those vendors that are unlikely to be selected by the customer since their characteristics are less consistent with those needed by the customer and, therefore, are unlikely to result in a sale.

公开(公告)号：US20130006876A1

公开(公告)日：2013-01-03

申请号：US13173357

申请日：2011-06-30

Applicant: Michael Swinson ,  Param Pash Kaur Dhillon ,  Thomas J. Sullivan ,  Xingchu Liu

Inventor： Michael Swinson ,  Param Pash Kaur Dhillon ,  Thomas J. Sullivan ,  Xingchu Liu

IPC: G06Q99/00

CPC classification number: G06Q30/0206 ,  G06Q30/02 ,  G06Q30/0205

Abstract: Disclosed are embodiments for the aggregation and analysis of vehicle prices via a geo-specific model. Data may be collected at various geo-specific levels such as a ZIP-Code level to provide greater data resolution. Data sets taken into account may include demarcation point data sets and data sets based on vehicle transactions. A demarcation point data set may be based on consumer market factors that influence car-buying behavior. Vehicle transactions may be classified into data sets for other vehicles having similar characteristics to the vehicle. A geo-specific statistical pricing model may then be applied to the data sets based on similar characteristics to a particular vehicle to produce a price estimation for the vehicle.

Abstract translation: 公开了通过地理特定模型来聚合和分析车辆价格的实施例。 可以在各种地理特定级别（例如ZIP-Code级别）收集数据以提供更大的数据分辨率。 考虑的数据集可以包括基于车辆交易的分界点数据集和数据集。 分界点数据集可以基于影响购车行为的消费者市场因素。 车辆交易​​可以分类为具有与车辆相似特征的其他车辆的数据集。 然后可以基于与特定车辆的相似特征将数据集合应用到地理特定的统计定价模型以产生车辆的价格估计。

公开(公告)号：US08620763B2

公开(公告)日：2013-12-31

申请号：US13291544

申请日：2011-11-08

Applicant: Thomas J. Sullivan ,  Isaac Lemon Laughlin ,  Tyson Fritz Nassauer ,  Michael Swinson

Inventor： Thomas J. Sullivan ,  Isaac Lemon Laughlin ,  Tyson Fritz Nassauer ,  Michael Swinson

IPC: G06Q30/00

CPC classification number: G06Q30/0202 ,  G06Q10/06398

Abstract: In embodiments disclosed herein, a computer may operate to determine, for each member in a set and each non-member under consideration for the set, an expected revenue to be passed to a parent organization. The expected revenue may be determined utilizing a plurality of weighted features. Members in the set may be ranked according to their expected revenues. Top performing members in the set may be protected to ensure their expected revenues. Bottom performing members may be removed from the set and/or replaced with new members outside of geographical protective areas of the top performing members. The optimization process can be repeated until the set of members can satisfy an existing demand while maximizing revenue for the parent organization.

Abstract translation: 在本文公开的实施例中，计算机可以操作以针对集合中的每个成员以及正在考虑的集合中的每个非成员确定要传递给母组织的预期收入。 可以利用多个加权特征来确定预期收入。 集团成员可按其预期收入排名。 该集团中表现最佳的成员可能受到保护，以确保其预期收入。 底层表演成员可以从组中移除和/或替换为最高成绩成员的地理保护区域之外的新成员。 可以重复优化过程，直到该组成员能够满足现有需求，同时最大化上级组织的收入。