Method for processing data to check an interactive communication sequence and system thereof
Uloženo v:
| Název: | Method for processing data to check an interactive communication sequence and system thereof |
|---|---|
| Patent Number: | 7,991,884 |
| Datum vydání: | August 02, 2011 |
| Appl. No: | 12/337278 |
| Application Filed: | December 17, 2008 |
| Abstrakt: | The present invention relates to a data processing method and system for checking an interactive communication sequence (ICS) relating to a plurality of users in a communication record by using a variable time window, and checking an interactive communication sequence pattern (ICSP) that is a frequently generated interactive communication sequence from among the checked interactive communication sequences. The data processing method includes: (a) storing an inverse pair in a communication record in an interactive communication sequence set or a candidate set that is a set of inverse pairs that can be part of the interactive communication sequence; (b) generating an interactive communication sequence having a length other than 1 by combining interactive communication sequences included in the interactive communication sequence set; and (c) generating an interactive communication sequence having a length other than 1 by combining the inverse pair included in the candidate set and one of the interactive communication sequence included in the interactive communication sequence set of (a) and the interactive communication sequence generated in (b). |
| Inventors: | Park, Man Ho (Daejeon, KR); Choi, Song In (Daejeon, KR); Ahn, Jee Hwan (Daejeon, KR); Lim, Byung Wan (Seoul, KR); Song, Ji Hwan (Seoul, KR); Kim, Myoung Ho (Daejeon, KR) |
| Assignees: | Electronics and Telecommunications Research Institute (Daejon, KR), Korea Advanced Institute of Science and Technology (Daejeon, KR) |
| Claim: | 1. A method for processing data comprising: (a) storing, by a data processing system, an inverse pair provided in a communication record in an interactive communication sequence set or a candidate set that is a set of inverse pairs that can be part of the interactive communication sequence; (b) generating, by the data processing system an interactive communication sequence having a length other than 1 by combining interactive communication sequences included in the interactive communication sequence set; and (c) generating, by the data processing system an interactive communication sequence having a length other than 1 by combining the inverse pair included in the candidate set and one of the interactive communication sequence included in the interactive communication sequence set of (a) and the interactive communication sequence generated in (b). |
| Claim: | 2. The method of claim 1 , further comprising (d) extracting an interactive communication sequence pattern (ICSP) that is a frequently generated interactive communication sequence based on the number of times of repeating the interactive communication sequence included in the interactive communication sequence set of (a), the interactive communication sequence generated in (b), and the interactive communication sequence generated in (c). |
| Claim: | 3. The method of claim 2 , wherein the (d) includes: calculating the number of times of repeating the interactive communication sequence included in the interactive communication sequence set of (a), the interactive communication sequence generated in (b), and the interactive communication sequence generated in (c); and extracting the interactive communication sequence that is repeated greater than a predetermined number of times as an interactive communication sequence pattern (ICSP). |
| Claim: | 4. The method of claim 3 , wherein the (a) includes: searching an inverse pair provided in the communication record; determining whether a response time of the inverse pair is greater than a basic time window; storing the inverse pair in the interactive communication sequence set when the response time of the inverse pair is less than or equal to the basic time window; and storing the inverse pair in the candidate set when the response time of the inverse pair is greater than the basic time window. |
| Claim: | 5. The method of claim 4 , wherein in (b) and (c), an interactive communication sequence having the length other than 1 is generated by combining the inverse pair having the length 1 and an interactive communication sequence having no limits of the length. |
| Claim: | 6. The method of claim 5 , wherein the interactive communication sequence having the length other than 1 in (b) is generated by combining the interactive communication sequence included in the interactive communication sequence set of (a) and the interactive communication sequence having no limits of the length. |
| Claim: | 7. The method of claim 6 , wherein the interactive communication sequence having the length other than 1 generated in (b) is determined based on a matched state of communication objects and a communication generation time. |
| Claim: | 8. The method of claim 5 , wherein the interactive communication sequence having the length other than 1 in (c) is generated by combining the inverse pair included in the candidate set of (a) and the interactive communication sequence having no limits of the length. |
| Claim: | 9. The method of claim 8 , wherein generating of the interactive communication sequence having the length other than 1 in (c) is determined based on a matched state of communication objects, a communication generation time, and a time window condition. |
| Claim: | 10. A method for processing data comprising: (a) extracting, by a data processing system, an inverse pair provided in a communication record, determining whether a response time of the inverse pair is less than a basic time window, and extracting an interactive communication sequence having the length 1; (b) extracting, by a data processing system, an interactive communication sequence having the length other than 1 by combining the inverse pairs while the time window is not extended; (c) extracting, by a data processing system, an interactive communication sequence having the length other than 1 by extending the time window and combining the inverse pairs; and (d) extracting, by a data processing system, an interactive communication sequence pattern (ICSP) that is a frequently generated interactive communication sequence based on the numbers of times of respectively repeating interactive communication sequences that are extracted in (a), (b), and (c). |
| Claim: | 11. The method of claim 10 , wherein, in (b) and (c), the interactive communication sequence having the length other than 1 is generated by combining the inverse pair having the length 1 and the interactive communication sequence having no limits of the length. |
| Claim: | 12. The method of claim 11 , wherein the interactive communication sequence having the length 1 extracted in (b) is generated by combining the interactive communication sequence having the length 1 extracted in (a), and is determined based on a matched state of communication objects and a communication generation time. |
| Claim: | 13. The method of claim 12 , wherein the interactive communication sequence having the length other than 1 extracted in (c) is determined based on a matched state of communication objects, a communication generation time, and a time window condition. |
| Claim: | 14. A system for processing data comprising: a data processing system, comprising: a set generator for generating an interactive communication sequence set that is a set of interactive communication sequences (ICSs) and a candidate set that is a set of inverse pairs that can be part of the interactive communication sequence by using an inverse pair provided in a communication; an ICS extractor for generating an interactive communication sequence having the length other than 1 based on the interactive communication sequence set and the candidate set generated by the set generator; and an ICSP checker for extracting an interactive communication sequence pattern (ICSP) that is a frequently generated interactive communication sequence from among interactive communication sequences generated by the ICS extractor. |
| Claim: | 15. The system of claim 14 , wherein the ICS extractor includes: an ICS extractor without extension of a time window for generating an interactive communication sequence having the length other than 1 by combining the interactive communication sequences included in the interactive communication sequence set; and an ICS extractor with extension of a time window for generating an interactive communication sequence having the length other than 1 by combining the inverse pair included in the candidate set and one of the interactive communication sequence included in the interactive communication sequence set and the interactive communication sequence generated by the ICS extractor without extension of a time window. |
| Claim: | 16. The system of claim 15 , wherein the ICSP checker extracts the interactive communication sequence pattern (ICSP) depending on whether the interactive communication sequences generated by the ICS extractor are repeated more than a predetermined number of times. |
| Claim: | 17. The system of claim 16 , wherein the set generator includes a searcher for searching an inverse pair provided in the communication record. |
| Claim: | 18. The system of claim 17 , further including: a transmitter/receiver for receiving the communication record from an electronic surveillance system; and an input/output unit for outputting an interactive communication sequence pattern (ICSP) checked by the ICSP checker. |
| Current U.S. Class: | 709/224 |
| Patent References Cited: | 5228026 July 1993 Albrow et al. 2001/0012345 August 2001 Nolting et al. 2005/0034042 February 2005 Davies et al. 2005/0271062 December 2005 Ezumi et al. 2006/0093142 May 2006 Schneier et al. 2007/0124789 May 2007 Sachson et al. 05-236009 September 1993 08-263216 October 1996 10-2007-0013442 January 2007 10-2007-0035300 March 2007 |
| Other References: | Rakesh Agrawal, et al., “Mining sequential patterns” Proc. 11th Int. Conf. on Data Engineering, ICDE, 1995 (Total 24 pages). cited by other Rakesh Agrawal, et al., “Fast algorithms for mining association rules” Proc. 20th Int. Conf. Very Large Data Bases, VLDB, 1994 (pp. 487-499). cited by other Mohammed J. Zaki, “SPADE: An Efficient Algorithm for Mining Frequent Sequences”. Machine Learning Journal, 2001 (pp. 31-60). cited by other Akihiro Inokuchi, et al., “An apriori-based algorithm for mining frequent substructures from graph data” Principles of Data Mining and Knowledge Discovery: 4th European Conference, PKDD 2000 (Total 11 pages). cited by other Michihiro Kuramochi, et al., “Frequent Subgraph Discovery” First IEEE International Conference on Data Mining, ICDM 2001 (pp. 313-320). cited by other Xifeng Yan, et al., “gSpan: Graph-based substructure pattern mining” Proc. 2002 Int. Conf. on Data Mining, ICDM, 2002 (pp. 721-724). cited by other |
| Primary Examiner: | Luu, Le |
| Attorney, Agent or Firm: | Staas & Halsey LLP |
| Přístupové číslo: | edspgr.07991884 |
| Databáze: | USPTO Patent Grants |
| Abstrakt: | The present invention relates to a data processing method and system for checking an interactive communication sequence (ICS) relating to a plurality of users in a communication record by using a variable time window, and checking an interactive communication sequence pattern (ICSP) that is a frequently generated interactive communication sequence from among the checked interactive communication sequences. The data processing method includes: (a) storing an inverse pair in a communication record in an interactive communication sequence set or a candidate set that is a set of inverse pairs that can be part of the interactive communication sequence; (b) generating an interactive communication sequence having a length other than 1 by combining interactive communication sequences included in the interactive communication sequence set; and (c) generating an interactive communication sequence having a length other than 1 by combining the inverse pair included in the candidate set and one of the interactive communication sequence included in the interactive communication sequence set of (a) and the interactive communication sequence generated in (b). |
|---|