-
公开(公告)号：US20110295649A1
公开(公告)日：2011-12-01
申请号：US12790850
申请日：2010-05-31
申请人： Shai Fine , Elad Yom-Tov , Yossi Richter
发明人： Shai Fine , Elad Yom-Tov , Yossi Richter
CPC分类号： G06Q30/0202 , G06Q30/0201
摘要： Churn prediction is performed by monitoring quality of service levels provided to customers. A time in which the customer is due to either churn or renew his agreement with the service provider may be monitored or computed. Machine learning methods may be utilized to determine a probability of churn based on historic data. Based upon the determination an output to retention personnel may be provided and an improved offer may be made to customers that are deemed in risk of churning.
摘要翻译： 通过监控提供给客户的服务水平来进行流失预测。 可能会监控或计算客户应该与服务提供商协商或更新协议的时间。 可以利用机器学习方法来确定基于历史数据的流失概率。 根据确定，可以提供保留人员的产出，并且可以对被认为有搅拌风险的客户进行改进的报价。
-
公开(公告)号：US20060085399A1
公开(公告)日：2006-04-20
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译： 查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。 该单元从重叠的程度产生查询难度预测。
-
公开(公告)号：US20120188898A1
公开(公告)日：2012-07-26
申请号：US13420629
申请日：2012-03-15
申请人： Yossi Richter , Elad Yom-Tov
发明人： Yossi Richter , Elad Yom-Tov
CPC分类号： H04W24/04
摘要： Determining a network transmitter that is more likely to cause handoff failures in a telecommunication service based on historical data records. The historical data records may be standard Call Data Records. A probability that a service provided by a first network transmitter will be handoffed to a second network transmitter is determined. An indication that a target network transmitter is overly busy is determined based on the number of failed services for each network transmitter that may handoff a service the target network transmitter and the probability that a service will be handoffed to the target network transmitter. Based on the indication, measures may be taken to increase quality level of the target network transmitter.
摘要翻译： 基于历史数据记录确定更有可能导致电信业务切换失败的网络发射机。 历史数据记录可以是标准的呼叫数据记录。 确定由第一网络发射机提供的服务将切换到第二网络发射机的概率。 基于对于可以切换目标网络发射机的服务的每个网络发射机的失败服务的数量以及服务将被切换到目标网络发射机的概率，确定目标网络发射机过度忙碌的指示。 根据指示，可采取措施提高目标网络发射机的质量水平。
-
公开(公告)号：US20110184676A1
公开(公告)日：2011-07-28
申请号：US12836605
申请日：2010-07-15
CPC分类号： H04Q9/00 , H04Q2209/30 , H04Q2209/40 , H04Q2209/60 , H04Q2209/84
摘要： An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and aggregate the data according to groups of child nodes. The aggregation provides for a reduced version of the data. The reduction is performed based on groups determined by clustering. The reduced version of the data comprises data describing a group of measurements over time, such as a centroid in an n-dimension space, number of customers in the group, radius of the group and the like. The centroid may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of centroids of each group over time.
摘要翻译： 先进的计量基础设施包括中间节点。 中间节点从子节点接收数据，并根据子节点组聚合数据。 聚合提供数据的缩减版本。 基于通过聚类确定的组来执行缩减。 数据的缩减版本包括描述一段时间内的一组测量的数据，例如n维空间中的质心，组中的客户数量，组的半径等。 中心可能会根据消费情况随时间而变化，例如中午消费低，晚上消费高。 消费概况可以在学习阶段确定，并且可以随着时间推移各组的质心。
-
公开(公告)号：US20110181437A1
公开(公告)日：2011-07-28
申请号：US12836627
申请日：2010-07-15
CPC分类号： H04Q9/00 , H04Q2209/30 , H04Q2209/40 , H04Q2209/60 , H04Q2209/84
摘要： An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and relay a subset of the data that is not according to an expected value. The expected value may be determined based on a forecasting function computed based on past data. The expected value may be a spatial shape in an n-dimension space. A data not within the spatial shape may be considered not in accordance with the expected value. In some case, the spatial shape is defined by a centroid and a radius. The spatial shape may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of spatial shapes of each group over time.
摘要翻译： 先进的计量基础设施包括中间节点。 中间节点从子节点接收数据，并中继不符合预期值的数据子集。 期望值可以基于基于过去数据计算的预测函数来确定。 期望值可以是n维空间中的空间形状。 不在空间形状内的数据可以被认为不符合预期值。 在某些情况下，空间形状由质心和半径定义。 空间形状可能会根据消费情况随时间而变化，例如中午消费低，晚上消费高。 消费概况可以在学习阶段中确定，并且可以随着时间推移各组的空间形状。
-
公开(公告)号：US07406462B2
公开(公告)日：2008-07-29
申请号：US10968692
申请日：2004-10-19
申请人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Lawrence Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/957 , Y10S707/99932 , Y10S707/99933
摘要： A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.
摘要翻译： 查询难度预测单元包括查询难度预测器，用于确定从在输入查询上操作的搜索引擎接收的查询文档与从输入查询的子查询操作的搜索引擎接收到的子查询文档之间的重叠程度。 该单元从重叠的程度产生查询难度预测。
-
公开(公告)号：US07984039B2
公开(公告)日：2011-07-19
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager is in communication with a plurality of components, wherein a component is a search engine working on a document collection and returning results in the form of a list of documents to a search query. The search manager submits a query to the plurality of components, receives results from each component in the form of a list of documents; estimates the success of a component in handling the query to generate a merit score for a component per query; applies the merit score to the results for the component; and merges results from the plurality of components by ranking in order of the applied merit score.
摘要翻译： 提供了一种在分布式信息检索中合并结果的方法和系统。 搜索管理器与多个组件进行通信，其中组件是对文档收集工作的搜索引擎，并以搜索查询的文档列表的形式返回结果。 搜索管理器向多个组件提交查询，以文档列表的形式从每个组件接收结果; 估计组件处理查询的成功，以生成每个查询的组件的优点得分; 将优点分数应用于组件的结果; 并且通过按照所应用的优点得分的顺序来排列来自多个组分的结果。
-
公开(公告)号：US20080033971A1
公开(公告)日：2008-02-07
申请号：US11461464
申请日：2006-08-01
申请人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Dan Pelleg , Elad Yom-Tov
IPC分类号： G06F7/00
CPC分类号： G06F17/30675
摘要： A method and system for analyzing a document set (202, 420) are provided. The method includes determining a set of terms (312) from the terms of the document set that minimizes a distance measurement (405) from the given set of documents (420). The method includes using a greedy algorithm to build the set of terms incrementally, at each stage finding a single word that is closest to the document set (202, 420). The set of terms is evaluated to assess the ability to find the document set (202, 420). The set of terms are compared with expected terms to evaluate the ability to find the document set (202, 420). A measure of the ability to find a document set (202, 420) is provided by computing a distance measure (403) between a document set and an entire collection.
摘要翻译： 提供了一种用于分析文档集（202,420）的方法和系统。 该方法包括从文档集合的术语中确定一组术语（312），该文档集合的术语使距离给定文档集合（420）最小化距离测量（405）。 该方法包括使用贪心算法逐渐建立术语集合，在每个阶段找到最靠近文档集（202,420）的单个单词。 评估一组术语以评估查找文档集（202,420）的能力。 将这组术语与预期术语进行比较，以评估查找文档集（202,420）的能力。 通过计算文档集和整个集合之间的距离度量（403）来提供查找文档集（202,420）的能力的度量。
-
公开(公告)号：US20070016574A1
公开(公告)日：2007-01-18
申请号：US11183086
申请日：2005-07-14
申请人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
发明人： David Carmel , Adam Darlow , Shai Fine , Elad Yom-Tov
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A method and system are provided of merging results in distributed information retrieval. A search manager (104) is in communication with a plurality of components, wherein a component is a search engine (106-108) working on a document collection and returning results in the form of a list of documents to a search query. The search manager (104) submits a query (202) to the plurality of components, receives results (213) from each component in the form of a list of documents; estimates (208) the success of a component in handling the query to generate a merit score (210) for a component per query; applies (220) the merit score (210) to the results for the component; and merges (222) results from the plurality of components by ranking in order of the applied merit score.
摘要翻译： 提供了一种在分布式信息检索中合并结果的方法和系统。 搜索管理器（104）与多个组件通信，其中组件是在文档收集上工作的搜索引擎（106-108），并以搜索查询的文档列表的形式返回结果。 搜索管理器（104）向多个组件提交查询（202），以文档列表的形式从每个组件接收结果（213）; 估计（208）组件在处理查询中的成功以生成每个查询的组件的优点得分（210）; 将优点得分（210）（220）应用于组件的结果; 并通过按照应用的优点得分的顺序来合并来自多个成分的结果（222）。
-
公开(公告)号：US08447308B2
公开(公告)日：2013-05-21
申请号：US13420629
申请日：2012-03-15
申请人： Yossi Richter , Elad Yom-Tov
发明人： Yossi Richter , Elad Yom-Tov
IPC分类号： H04W36/00
CPC分类号： H04W24/04
摘要： Determining a network transmitter that is more likely to cause handoff failures in a telecommunication service based on historical data records. The historical data records may be standard Call Data Records. A probability that a service provided by a first network transmitter will be handoffed to a second network transmitter is determined. An indication that a target network transmitter is overly busy is determined based on the number of failed services for each network transmitter that may handoff a service the target network transmitter and the probability that a service will be handoffed to the target network transmitter. Based on the indication, measures may be taken to increase quality level of the target network transmitter.
摘要翻译： 基于历史数据记录确定更有可能导致电信业务切换失败的网络发射机。 历史数据记录可以是标准的呼叫数据记录。 确定由第一网络发射机提供的服务将切换到第二网络发射机的概率。 基于对于可以切换目标网络发射机的服务的每个网络发射机的失败服务的数量以及服务将被切换到目标网络发射机的概率，确定目标网络发射机过度忙碌的指示。 根据指示，可采取措施提高目标网络发射机的质量水平。
-
-
-
-
-
-
-
-
-
搜索结果
53 条记录 (耗时 0.022 秒)
