公开(公告)号：WO2007042403A9

公开(公告)日：2007-09-13

申请号：PCT/EP2006066858

申请日：2006-09-28

Applicant: IBM ,  IBM UK ,  AGGARWAL CHARU ,  YU PHILIP SHI-LUNG

Inventor： AGGARWAL CHARU ,  YU PHILIP SHI-LUNG

IPC: G06F21/24

CPC classification number: G06F21/604 ,  G06F21/6245 ,  G06F21/6254

Abstract: Improved privacy preservation techniques are disclosed for use in accordance with data mining. By way of example, a technique for preserving privacy of data records for use in a data mining application comprises the following steps/operations. Different privacy levels are assigned to the data records. Condensed groups are constructed from the data records based on the privacy levels, wherein summary statistics are maintained for each condensed group. Pseudo-data is generated from the summary statistics, wherein the pseudo-data is available for use in the data mining application. Principles of the invention are capable of handling both static and dynamic data sets.

Abstract translation: 公开了根据数据挖掘使用的改进的隐私保护技术。 作为示例，用于保留用于数据挖掘应用的数据记录的隐私的技术包括以下步骤/操作。 不同的隐私级别被分配给数据记录。 基于隐私级别的数据记录构建简化组，其中为每个缩合组维护概要统计。 从摘要统计生成伪数据，其中伪数据可用于数据挖掘应用程序。 本发明的原理能够处理静态和动态数据集。

公开(公告)号：EP1380004A4

公开(公告)日：2008-07-23

申请号：EP02715182

申请日：2002-03-22

Applicant: IBM

Inventor： WANG WEI ,  YANG JIONG ,  YU PHILIP SHI-LUNG

IPC: G06F19/24 ,  G06K9/00 ,  G06K9/68

CPC classification number: G06K9/62 ,  G06F19/24 ,  Y10S707/99936

Abstract: A system and method for determining patterns in a data sequence (Fig. 1) constructs a compatibility matrix (100) which provides a probability between an actual occurrence of an item and an observed occurrence of that or another item between each item in the data sequence. Candidate patterns are generated (201). The candidate patterns include items in the data sequence. The candidate patterns are checked against the data sequence to determine a match value (203) based on the compatibility matrix, and significant matches are determined based on candidate patterns having the match value above a threshold (204).

公开(公告)号：JP2002304565A

公开(公告)日：2002-10-18

申请号：JP2002031370

申请日：2002-02-07

Applicant: IBM

Inventor： BOIES STEPHEN J ,  DINKIN SAMUEL ,  MOSKOWITZ PAUL A ,  YU PHILIP SHI-LUNG ,  GREENE DAVID P

IPC: G06Q30/02 ,  G06Q30/06 ,  G06F17/60

Abstract: PROBLEM TO BE SOLVED: To provide a method and system for providing a consumer aggregation service in a network service provider. SOLUTION: At first, when a user registers himself or herself in a consumer collecting service 110, the consumer collecting service 110 replaces the identification information of the registered user 134 with its own identification information when the registered user 134 reads a world wide web(WWW) site. Moreover, the consumer collecting server 110 intercepts an electronic merchandise order made by the registered user 134 with a retailer 124 though a network 100, and charges the registered user 134 with the order, and carries out the order with the retailer 124 on behalf of the registered user 134, and makes the retail agent 124 charge the consumer aggregation service itself with the order. Moreover, the consumer collecting server 110 collects coupons or bonuses from the retailers 124 based on shopping performed by the registered users 134, and stores them in a data base, and distributes the collected coupons or bonuses to the registered users 134 in a prescribed method.

公开(公告)号：JP2002014816A

公开(公告)日：2002-01-18

申请号：JP2001134091

申请日：2001-05-01

Applicant: IBM

Inventor： CHARU C AGAWAL ,  YU PHILIP SHI-LUNG

IPC: G06F9/44 ,  G06F17/30 ,  G06K9/62 ,  G06N5/04

Abstract: PROBLEM TO BE SOLVED: To provide a method and device for preparing an effective and valid decision tree for executing valid classification. SOLUTION: In this method and device for generating a decision tree by using linear judgment analysis, and for executing the decision tree for data classification (categorization), it is desired that the data are constituted in the format of multi-dimensional objects, for example, the format of data records including characteristic valuables and class variables in a decision tree generation mode and data records including only the characteristics variables in a decision tree scanning mode. For example, a more effective classification system with monitor is prepared by this method. Generally, the recursive division of the decision tree is included in this method so that the maximum amounts of separation can be achieved among the class values of training data. This is executed by finding the effective combination of the variables in order to prepare the decision tree by recursively dividing the training data. This decision tree is used for classifying input test data afterwards.

公开(公告)号：WO02067484A3

公开(公告)日：2003-05-30

申请号：PCT/US0146440

申请日：2001-12-06

Applicant: IBM

Inventor： YU PHILIP SHI-LUNG ,  STERN EDITH H ,  WILLNER BARRY E ,  GREENE DAVID P

IPC: H04W4/02 ,  H04Q7/20

CPC classification number: H04W4/02 ,  F41A19/01 ,  G08B13/1418

Abstract: Systems and methods are provided wherein a base device facilitates a determination of a location associated with an occurrence of an event. A location of the base device is determined, and the base device receives information from an event device fig. 3, element 602. For example, a device in a police automobile may receive information from a police handgun via a wireless communication. Information is then stored to enable a determination of a location associated with an occurrence of an event.

Abstract translation: 提供了系统和方法，其中基本设备便于确定与事件发生相关联的位置。 确定基本设备的位置，并且基本设备从事件设备接收信息。 例如，警察汽车中的装置可以经由无线通信从警察手枪接收信息。 然后存储信息以使得能够确定与事件的发生相关联的位置。

公开(公告)号：JP2005100363A

公开(公告)日：2005-04-14

申请号：JP2004234267

申请日：2004-08-11

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： AGGARWAL CHARU C ,  YU PHILIP SHI-LUNG

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30516 ,  G06F17/30598 ,  Y10S707/99931 ,  Y10S707/99943

Abstract: PROBLEM TO BE SOLVED: To improve cluster quality when data substantially proceeds with a lapse of time.
SOLUTION: In regard to a technique performing data clustering of a data stream, first, online statistics are generated from a data stream. Thereafter, offline processing of the online statistics is performed when the offline processing is needed or desired. The online statistics can be generated through the reception of data points from the data stream, and the formation and the update of a data group. The offline processing can be performed by re-clustering the data point group in the periphery of the sampled data points, and a newly formed cluster is reported.
COPYRIGHT: (C)2005,JPO&NCIPI

Abstract translation: 要解决的问题：当数据实际上随时间流逝时，提高集群质量。 解决方案：对于执行数据流的数据聚类的技术，首先，从数据流生成在线统计。 此后，当需要或期望离线处理时，执行在线统计的离线处理。 可以通过从数据流接收数据点，以及数据组的形成和更新来生成在线统计信息。 离线处理可以通过对采样数据点的外围的数据点组进行重新聚类来执行，并且报告新形成的簇。 版权所有（C）2005，JPO＆NCIPI

公开(公告)号：JP2002024741A

公开(公告)日：2002-01-25

申请号：JP2001164872

申请日：2001-05-31

Applicant: IBM

Inventor： WEI WAN ,  CHON YAN ,  YU PHILIP SHI-LUNG

IPC: G06F19/00 ,  G06F9/22 ,  G06F9/42 ,  G06F9/44 ,  G06F17/30 ,  G06K9/00

Abstract: PROBLEM TO BE SOLVED: To provide a method for distinguishing and finding a significant cyclic pattern in event subsequence even when the pattern includes disturbance having a length up to a threshold value of prior definition. SOLUTION: A method for distinguishing a partial cyclic pattern in event sequence that includes a list of events from the event sequence in the pattern is provided. At least one pattern which is at least one subsequence in the event sequence and at least one pattern in at least one subsequence distinguishes at least one subsequence in the event sequence and at least one pattern in at least one subsequence which exceeds the minimum repetitive number in at least one subsequence and in which a distance between continuous repetitions of at least one pattern in at least one subsequence does not exceed a distance threshold value of prior definition. At least one of at least one pattern and at least one subsequence is stored.

公开(公告)号：JP2007220140A

公开(公告)日：2007-08-30

申请号：JP2007114983

申请日：2007-04-25

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： JORDAN KEVIN MICHAEL ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F12/00 ,  G06F9/50 ,  G06F13/00

CPC classification number: G06F9/505

Abstract: PROBLEM TO BE SOLVED: To provide a method and system for cache server balancing.
SOLUTION: In a system including a collection of cooperating cache servers such as proxy cache servers, a request can be forwarded to a cooperating cache server if the requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all the clients and the cache servers that contain those hot objects become overloaded due to forwarded requests. In response, the load is balanced by shifting some or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.
COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供缓存服务器平衡的方法和系统。 解决方案：在包括合作缓存服务器（如代理缓存服务器）的集合的系统中，如果请求的对象不能在本地找到，则可以将请求转发到协作缓存服务器。 如果例如由于引用偏斜而检测到过载状况，则所有客户端都需要一些对象，并且包含这些热对象的缓存服务器由于转发请求而变得过载。 作为响应，通过将一些或全部转发的请求从重载的缓存服务器移动到较少的缓存服务器来平衡负载。 描述了集中式和分布式负载均衡环境。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JPH1155252A

公开(公告)日：1999-02-26

申请号：JP15112198

申请日：1998-06-01

Applicant: IBM

Inventor： CROSSKEY JAMES P ,  MEI MARK GEE-GWO ,  RAGAVAN HARISH ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: B65G61/00 ,  G06F13/00 ,  G06Q20/10 ,  G06Q30/02 ,  G06Q30/04 ,  H04L12/14 ,  H04L29/06 ,  H04L29/08 ,  H04M15/00 ,  G06F17/60 ,  H04L12/54 ,  H04L12/58

Abstract: PROBLEM TO BE SOLVED: To provide a system and method for charging to one or plural persons concerned in response to a client access to an internet. SOLUTION: At least one of one or plural persons concerned is identified as a person responsible for payment of claimed charge (a step 203). Then, charge is shared by each responsible person concerned based on a prescribed function. Then, the total sum of the charge to each responsible person concerned is calculated based on the function of share and the band width using amounts by the client (a step 204).

公开(公告)号：HU224787B1

公开(公告)日：2006-02-28

申请号：HU0104250

申请日：1999-10-08

Applicant: IBM

Inventor： JORDAN KEVIN MICHAEL ,  WU KUN-LUNG ,  YU PHILIP SHI-LUNG

IPC: G06F9/46 ,  G06F12/00 ,  G06F9/50 ,  G06F13/00

Abstract: In a system including a collection of cooperating cache servers, such as proxy cache servers, a request can be forwarded to a cooperating cache server if the requested object cannot be found locally. An overload condition is detected if for example, due to reference skew, some objects are in high demand by all the clients and the cache servers that contain those hot objects become overloaded due to forwarded requests. In response, the load is balanced by shifting some or all of the forwarded requests from an overloaded cache server to a less loaded one. Both centralized and distributed load balancing environments are described.