Christos N Faloutsos from Sunnyvale, CA, age 66

Us Patents

Method Of Reducing Dimensionality Of A Set Of Attributes Used To Characterize A Sparse Data Set
view source
US Patent:

6735589, May 11, 2004
Filed:

Jun 7, 2001
Appl. No.:

09/876321
Inventors:

Paul S. Bradley - Seattle WA
Demetrios Achlioptas - Seattle WA
Christos Faloutsos - Pittsburgh PA
Usama Fayyad - Mercer Island WA
Assignee:

Microsoft Corporation - Redmond WA
International Classification:

G06F 1730
US Classification:

707 6, 707100, 707101, 707102
Abstract:

A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension mÃk from an original matrix data set D of dimension mÃk wherein n k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1,. . . , m and the n columns correspond to attributes Aj where j=1,. . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set. The steps of the method include: for each of the attributes Aj in the original data set D, calculating a value of variance of the data values associated with attribute Aj, where the variance value, Var(Aj), of the attribute Aj is calculated as follows: where Mean(Aj) is the mean value of the data values corresponding to attribute Aj; selecting the k attributes having the greatest variance values; and generating the reduced data set Dnew by selecting data values in the original data set D corresponding to the selected k attributes.

Auditing Compliance With A Hippocratic Database
view source
US Patent:

7810142, Oct 5, 2010
Filed:

Mar 21, 2005
Appl. No.:

11/084035
Inventors:

Rakesh Agrawal - San Jose CA, US
Roberto Bayardo - Morgan Hill CA, US
Christos Faloutsos - Pittsburgh PA, US
Gerald George Kiernan - San Jose CA, US
Ralf Rantzau - San Jose CA, US
Ramakrishnan Srikant - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

H04L 9/00
US Classification:

726 5, 707608
Abstract:

An auditing framework for determining whether a database disclosure of information adhered to its data disclosure policies. Users formulate audit expressions to specify the (sensitive) data subject to disclosure review. An audit component accepts audit expressions and returns all queries (deemed “suspicious”) that accessed the specified data during their execution.

Direction-Aware Proximity For Graph Mining
view source
US Patent:

7925599, Apr 12, 2011
Filed:

Feb 11, 2008
Appl. No.:

12/069500
Inventors:

Yehuda Koren - Elizabeth NJ, US
Christos Faloutsos - Pittsburgh PA, US
Hanghang Tong - Pittsburgh PA, US
Assignee:

AT&T Intellectual Property I, L.P. - Atlanta GA
International Classification:

G06N 5/02
US Classification:

706 12
Abstract:

A method and system for graph mining direction-aware proximity measurements. A directed graph includes nodes and directed edges connecting the nodes. A direction-aware proximity measurement is calculated from a first node to a second node or from a first group of nodes to a second group of nodes. The direction-aware proximity measurement from a first node to second node is based on an escape probability from the first node to the second node. Disclosed herein are methods for efficiently calculating one or multiple direction-aware proximity measurements. The direction-aware proximity measurements can be used in performing various graph mining applications.

System, Method, And Service For Finding An Optimal Collection Of Paths Among A Plurality Of Paths Between Two Nodes In A Complex Network
view source
US Patent:

20050243736, Nov 3, 2005
Filed:

Apr 19, 2004
Appl. No.:

10/827784
Inventors:

Christos Faloutsos - Pittsburgh PA, US
Kevin Snow McCurley - San Jose CA, US
Andrew Tomkins - San Jose CA, US
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

H04L001/00
US Classification:

370254000
Abstract:

An optimal path selection system extracts a connection subgraph in real time from an undirected, edge-weighted graph such as a social network that best captures the connections between two nodes of the graph. The system models the undirected, edge-weighted graph as an electrical circuit and solves for a relationship between two nodes in the undirected edge-weighted graph based on electrical analogues in the electric graph model. The system optionally accelerates the computations to produce approximate, high-quality connection subgraphs in real time on very large (disk resident) graphs. The connection subgraph is constrained to the integer budget that comprises a first node, a second node and a collection of paths from the first node to the second node that maximizes a “goodness” function g(H). The goodness function g(H) is tailored to capture salient aspects of a relationship between the first node and the second node.

Method For Characterizing Information In Data Sets Using Multifractals
view source
US Patent:

57583382, May 26, 1998
Filed:

Aug 28, 1996
Appl. No.:

8/704040
Inventors:

Christos Faloutsos - Silver Spring MD
Yossi Matias - Potomac MD
Abraham Silberschatz - Summit NJ
Assignee:

Lucent Technologies Inc. - Murray Hill NJ
International Classification:

G06F 1730
US Classification:

707 6
Abstract:

The invention concerns a method for estimating characteristic information of data items in a data set, such as a database, based on parameters of a multifractal distribution. The invention facilitates efficient estimation of such characteristic information of data contained in a data set more accurately than known estimation methods and without requiring an exhaustive analysis of the data. The invention also concerns an efficient technique for generating the parameters for the multifractal distribution.

Method And Apparatus For Analyzing Co-Evolving Time Sequences
view source
US Patent:

60554916, Apr 25, 2000
Filed:

Oct 17, 1997
Appl. No.:

8/953578
Inventors:

Alexandros Biliris - Chatham NJ
Christos N. Faloutsos - Silver Spring MD
Hosagrahar Visvesvaraya Jagadish - Berkeley Heights NJ
Theodore Johnson - New York NY
Assignee:

AT&T Corp. - New York NY
University of Maryland - College Park MD
International Classification:

G06G 719
US Classification:

702176
Abstract:

An analyzer system that analyzes a plurality of co-evolving time sequences to, for example, perform correlation or outlier detection on the time sequences. The plurality of co-evolving time sequences comprise a delayed time sequence and one or more known time sequences. A goal is to predict the delayed value given the available information. The plurality of time sequences have a present value and (N-1) past values, where N is the number of samples (time-ticks) of each time sequence. The analyzer system receives the plurality of co-evolving time sequences and determines a window size ("w"). The analyzer then assigns the delayed time sequence as a dependent variable and the present value of a subset of the known time sequences, and the past values of the subset of known time sequences and the delayed time sequence, as a plurality of independent variables. Past values delayed by up to "w" steps are considered. The analyzer then forms an equation comprising the dependent variable and the independent variables, and then solves the equation using a least squares method.

Method For High-Dimensionality Indexing In A Multi-Media Database
view source
US Patent:

56470584, Jul 8, 1997
Filed:

Feb 28, 1996
Appl. No.:

8/607922
Inventors:

Rakesh Agrawal - San Jose CA
William Robinson Equitz - Palo Alto CA
Christos Faloutsos - Silver Spring MD
Myron Dale Flickner - San Jose CA
Arun Narasimha Swami - San Jose CA
Assignee:

International Business Machines Corporation - Armonk NY
International Classification:

G06F 1730
US Classification:

395601
Abstract:

A high dimensional indexing method is disclosed which takes a set of objects that can be viewed as N-dimensional data vectors and builds an index which treats the objects like k-dimensional points. The method first defines and applies a set of feature extraction functions that admit some similarity measure for each of the stored objects in the database. The feature vector is then transformed in a manner such that the similarity measure is preserved and that the information of the feature vector v is concentrated in only a few coefficients. The entries of the feature vectors are truncated such that the entries which contribute little on the average to the information of the transformed vectors are removed. An index based on the truncated feature vectors is subsequently built using a point access method (PAM). A preliminary similarity search can then be conducted on the set of truncated transformed vectors using the previously created index to retrieve the qualifying records.

Compressed Representation Of A Data Base That Permits Ad Hoc Querying
view source
US Patent:

59466928, Aug 31, 1999
Filed:

May 8, 1997
Appl. No.:

8/848454
Inventors:

Christos N. Faloutsos - Silver Spring MD
Hosagrahar Visvesvaraya Jagadish - Berkeley Heights NJ
Philip Russell Korn - College Park MD
Assignee:

AT & T Corp - Middletown NJ
International Classification:

G06F 1730
US Classification:

707101
Abstract:

A method and system for compressing a data base that permits queries on the compressed representation of the data base. Another feature is that an approximation of the values of the data base are derivable directly from the compressed representation of the data base. Yet another feature is correction of poor approximations of the reconstructed data. Still another feature is the capability of performing aggregate queries of the compressed representation of the data base.

Isbn (Books And Publications)

Searching Multimedia Data Bases By Content
view source
Author:

Christos Faloutsos
ISBN #:

0792397770

Christos Faloutsos

view source

Dr. Christos Faloutsos is a professor of computer science at Carnegie Mellon University. He has received the Presidential Young Investigator Award by the ...

Christos Faloutsos

Work:

Company:

Carnegie Mellon University faculty

Area of science:

Computer scientist

Position:

Computer scientist • Investigator

Education:

Area of science:

Data mining

Academic degree:

Professor

Skills & Activities:

Ascribed status:

Fellow of the Association for Computing Machinery

Award:

Innovation Award

Christos N Faloutsos

Christos Faloutsos Phones & Addresses

Us Patents

Method Of Reducing Dimensionality Of A Set Of Attributes Used To Characterize A Sparse Data Set

Auditing Compliance With A Hippocratic Database

Direction-Aware Proximity For Graph Mining

System, Method, And Service For Finding An Optimal Collection Of Paths Among A Plurality Of Paths Between Two Nodes In A Complex Network

Method For Characterizing Information In Data Sets Using Multifractals

Method And Apparatus For Analyzing Co-Evolving Time Sequences

Method For High-Dimensionality Indexing In A Multi-Media Database

Compressed Representation Of A Data Base That Permits Ad Hoc Querying

Isbn (Books And Publications)

Searching Multimedia Data Bases By Content

Wikipedia

Christos Faloutsos

Wikipedia References

Christos Faloutsos

Christos Faloutsos

Youtube

Christos Faloutsos: How to find patterns in l...

Graph Mining: Laws, Generators & Tools

Christos Faloutsos.m4v

Christos Faloutsos How to find patterns in la...