Colibri: Fast Mining of Large Static and Dynamic Graphs (2009)
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, Philip S. Yu, Christos Faloutsos
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track the low-rank...
Using Ghost Edges for Classification in Sparsely Labeled Networks (2009)
Brian Gallagher, Hanghang Tong, Tina Eliassi-rad, Christos Faloutsos
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical relational learning...
Fast Mining of Complex Time-Stamped Events (2009)
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-rad, Christos Faloutsos
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero or more locations...
Algorithms, Experimentation (2009)
Chao Liu, Anitha Kannan, Tom Minka, Michael Taylor, Yi-min Wang, Christos Faloutsos, ...
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because they reflect users ’...
Faloutsos C: Fast Direction-Aware Proximity for Graph Mining (2009)
Hanghang Tong, Yehuda Koren, Christos Faloutsos
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in several graph mining...
Mobile Call Graphs: Beyond Power-Law and Lognormal Distributions ∗ (2009)
Mukund Seshadri, Jean Bolot, Sridhar Machiraju, Christos Faloutsos, Ashwin Sridharan
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distributions of the...
Stream Monitoring under the Time Warping Distance (2009)
Yasushi Sakurai, Christos Faloutsos, Masashi Yamamuro
Data stream processing has recently attracted an increasing amount of interest. The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query...
What is this part about? (2009)
Jure Leskovec, Christos Faloutsos, Matrix Tools, John Peter, Mary Nick
Tutorial outline � Part 1: Structure and models for networks � What are properties of large graphs? � How do we model them? � Part 2: Dynamics of networks � Diffusion and cascading behavior...
� Key Obstacles in Clustering Contingency Tables (2009)
Jure Leskovec, Christos Faloutsos, Ajit Singh
� Part 1: Structure and models for networks � What are properties of large graphs? � How do we model them? � � Part 2: Dynamics of networks � Diffusion and cascading behavior � How do...
� Social network analysis: sociologists and (2009)
Jure Leskovec, Christos Faloutsos, Bernardo Huberman, Jon Kleinberg, Andreas Krause, Mary Mcglohon, ...
About the tutorial Introduce properties, models and tools for � large real‐world networks � diff diffusion i processes in networks through real mining applications � Goal: find patterns,...
• Virus propagation and Diffusion (cascading (2009)
Jure Leskovec, Christos Faloutsos, Bernardo Huberman, Jon Kleinberg, Andreas Krause, Mary Mcglohon, ...
� Part 1: Structure and models for networks � What are properties of large graphs? � How do we model them? � � Part 2: Dynamics of networks � Diffusion and cascading behavior � How do...
Mobile Call Graphs: Beyond Power-Law and Lognormal Distributions ∗ (2009)
Mukund Seshadri, Jean Bolot, Sridhar Machiraju, Christos Faloutsos, Ashwin Sridharan
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distributions of the...
Information Propagation and Network Evolution on the Web (2009)
Mary Mcglohon, Jure Leskovec, Christos Faloutsos, Natalie Glance, Matthew Hurst
Using data gathered from blogs, this work seeks to understand the structure and formation of social networks, and the patterns of information propagation through these networks. Blogs have become an...
C-DEM: A Multi-Modal Query System for Drosophila Embryo Databases (2009)
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as information repositories as...
Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks (2009)
Abstract: The problem of deploying sensors in a large water distribution network is considered, in order to detect the malicious introduction of contaminants. It is shown that a large class of...
GRAPHITE: A Visual Query System for Large Graphs (2009)
Duen Horng Chau, Christos Faloutsos, Hanghang Tong, Jason I. Hong, Brian Gallagher, Tina Eliassi-rad
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and visualizes the...
Monitoring Network Evolution using MDL (2009)
Jure Ferlež, Christos Faloutsos, Jure Leskovec, Dunja Mladenić, Marko Grobelnik
Abstract — Given publication titles and authors, what can we say about the evolution of scientific topics and communities over time? Which communities shrunk, which emerged, and which split, over...
Weighted Graphs and Disconnected Components Patterns and a Generator (2009)
Mary Mcglohon, Leman Akoglu, Christos Faloutsos
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numerous, real, weighted...
Proximity Tracking on Time-Evolving Bipartite Graphs (2009)
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time-evolving bipartite...
Jure Leskovec, Christos Faloutsos, Deepay Chakrabarti, Natalie Glance, Bernardo Huberman, Jon Kleinberg, ...
Tutorial outline � Part 1: Structure and models for networks � What are properties of large graphs? � How do we model them? � Part 2: Dynamics of networks �...
Diffusion and Cascading Behavior – Part 1: Basic mathematical models (2009)
Jure Leskovec, Christos Faloutsos, Ajit Singh, Jeanne Vanbriesen, Virus Propagation
� Part 1: Structure and models for networks � What are properties of large graphs? � How do we model them? � Part 2: Dynamics of networks �...
and Data Mining Information recovery (2009)
C. Faloutsos, C C. Faloutsos, Christos Faloutsos
■ Qopt- selectivities ■ data warehousing ■ transaction recording systems (details: in tertiary store) ■ statistical/scientific db ■ data integration (partial info from many sources) 2....
• Variations / Applications • New concepts (2009)
Christos Faloutsos, R. Agrawal, R. Agrawal, T. Imielinski, A. Swami Mining, C. Faloutsos, ...
• Consider ‘market basket ’ case: (milk, bread)
• market basket as in Association Rules (2009)
Sun Sdm, Christos Faloutsos, Carnegie Mellon Univ, Tamara G. Kolda, Sandia National Labs, Jimeng Sun, ...
cloud of n-d points chol # blood # age..... 13 11 22 55...
LOCI: Fast Outlier Detection Using The Local Correlation Integral, (2009)
Outlier Detection, C. Faloutsos, Spiros Papadimitriou, Hiroyuki Kitagawa, Phillip B. Gibbons, Christos Faloutsos, ...
What is an outlier? Why outlier detection?
Spatial Access Methods- problem (2009)
Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos
z-ordering- Detailed outline • What is the problem / S.A.M. • z-ordering – main idea- 3 methods – use w / B-trees; algorithms (range, knn queries – non-point (eg., region) data –...
ABSTRACT Automatic Mining of Fruit Fly Embryo Images ∗ (2009)
Jia-yu Pan, André Guilherme, Ribeiro Balan, Eric P. Xing, Agma Juci, Machado Traina, ...
We present FEMine, an automatic system for image-based gene expression analysis. We perform experiments on the largest publicly available collection of Drosophila ISH (in situ hybridization) images,...
Christos Faloutsos, Pods Christos Faloutsos, Ibrahim Kamel, C. Faloutsos, C. Faloutsos, C. Faloutsos
Montgomery county: •Q1: how many d.a. for an R-tree? •Q2: distribution? •not uniform
Sharad Mehrotra, Christos Faloutsos, Uci C. Faloutsos, Dr. Deepayan Chakrabarti
• Static & dynamic laws; generators
Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos
x 1, x 2, … , x t, …
The Evolution of the Internet:Topology and Routing (2008)
Georgos Siganos, Michalis Faloutsos, Christos Faloutsos
Abstract—In this paper, we study the evolution of the Internet topology over the last three years. We study the evolution at three different levels: a) each node individually, b) the network as a...
Toward a Comprehensive Model in Internet Auction Fraud Detection (2008)
Bin Zhang, Yi Zhou, Christos Faloutsos
Fraud detection has become a common concern of the online auction websites. Fraudsters often manipulate reputation systems and commit nondelivery fraud. To deal with fraud in group behavior we...
C C. Faloutsos, J-y Pan, Jia-yu Pan, Christos Faloutsos, C C. Faloutsos, J-y Pan, ...
(Q1) Find patterns in data
Jure Leskovec, Christos Faloutsos, Bernardo Huberman, Jon Kleinberg, Andreas Krause, Mary Mcglohon, ...
� Social network analysis: sociologists and computer scientists –influence goes both ways � Large‐scale network data in “traditional ” sociological domains �...
Kronecker Graphs: an approach to modeling networks (2008)
Leskovec, Jure, Chakrabarti, Deepayan, Kleinberg, Jon, Faloutsos, Christos, Gharamani, Zoubin
How can we model networks with a mathematically tractable model that allows for rigorous analysis of network properties? Networks exhibit a long list of surprising properties: heavy tails for the...
Part 3: influence, virus prop., communities (2008)
Graph Mining Part, Christos Faloutsos, Deepayan Chakrabarti (cmu, Michalis Faloutsos (ucr, George Siganos (ucr, ...
eigenvalues
Abstract Using Utility to Provision Storage Systems (2008)
John D. Strunk, Eno Thereska, Christos Faloutsos, Gregory R. Ganger
Provisioning a storage system requires balancing the costs of the solution with the benefits that the solution will provide. Previous provisioning approaches have started with a fixed set of...
Christos Faloutsos, C. Faloutsos, C. Faloutsos, Wang+ Mengzhi Wang, Tara Madhyastha, Ngai Hang, ...
2) Implementation: buffering, indexing, q-opt 7) Data Analysis- data mining sensors, time series, indexing and wavelets sensors and forecasting 8) Benchmarks 9) vision statements extras...
Power Laws, C. Faloutsos, Christos Faloutsos, Deepayan Chakrabarti (cmu/yahoo, Michalis Faloutsos (ucr, George Siganos (ucr, ...
Applications of sensors/streams • ‘Smart house’: monitoring temperature, humidity etc • Financial, sales, economic series
(who-eats-whom) Web & citations Internet Sexual network Yeast protein (2008)
Jure Leskovec, Christos Faloutsos, Avrim Blum, Jon Kleinberg, John Lafferty
interactions
• Problem#5: Track communities over time (2008)
Graph Analysis Laws, Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos
• Static & dynamic laws; generators
Epidemic Thresholds in Real Networks (2008)
Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jurij Leskovec, Christos Faloutsos
How will a virus propagate in a real network? How long does it take to disinfect a network given particular values of infection rate and virus death rate? What is the single best node to immunize?...
Sensor Mining at work: Principles and a Water Quality Case-Study (2008)
Christos Faloutsos, Jeanne Vanbriesen
3 hours
Shashank P, Duen Horng Chau, Samuel Wang, Christos Faloutsos
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe,...
– Problem definition- Spatial Access Methods (2008)
Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos
• Given a collection of geometric objects (points, lines, polygons,...) • organize them on disk, to answer spatial queries (like??)
C C. Faloutsos, J-y Pan, C. Faloutsos, C C. Faloutsos, J-y Pan, Jia-yu Pan, ...
(Q1) Find patterns in data • Human would say – Pattern 1: along diagonal – Pattern 2: along vertical axis • How to find these automatically?
• civil/automobile infrastructure (2008)
C. Faloutsos, Christos Faloutsos, C C. Faloutsos, Deepay Chakrabarti (cmu, Spiros Papadimitriou (cmu, ...
• Similarity search – distance functions
Indexing Values in Continuous Field Databases (2008)
Myoung-ah Kang, Christos Faloutsos, Robert Laurini, Sylvie Servigne
Abstract. With the extension of spatial database applications, during the last years continuous field databases emerge as an important research issue in order to deal with continuous natural...
• Archive recovery • Conclusions (2008)
Christos Faloutsos, Recovery T. Haerder, A. Reuter, C. Faloutsos, C. Faloutsos, C. Faloutsos, ...
= unit of work, eg. move $10 from savings to checking Atomicity (all or none)
4) Distributed DBMSs 5) Parallel DBMSs: Gamma, Alphasort (2008)
Christos Faloutsos, C. Faloutsos, B Trees, B -trees, C. Faloutsos, C. Faloutsos, ...
• the most successful family of index
Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos
2) Implementation: buffering, indexing, q-opt
Christos Faloutsos, Hillol Kargupta, Ngdm C. Faloutsos, Ngdm C. Faloutsos, Ngdm C. Faloutsos, Dr. Deepayan Chakrabarti, ...
Data mining: ~ find patterns (rules, outliers) • Problem#1: How do real graphs look like? • Problem#2: How do they evolve? • Problem#3: How to generate realistic graphs
Spatial Query Estimation without the Local Uniformity Assumption (2008)
Yufei Tao, Christos Faloutsos, Dimitris Papadias, Yufei Tao
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their applicability is...
Hilbert R-tree: An Improved R-tree Using Fkactals (2008)
Ibrahim Kamel, Christos Faloutsos
kamelQcs.umd.edu We propose a new Rtree structure that out-performs all the older ones. The heart of the idea is to facilitate the deferred splitting ap preach in R-trees. This is done by propos-ing...
ABSTRACT Fast Discovery of Connection Subgraphs (2008)
Christos Faloutsos, Kevin S. Mccurley, Andrew Tomkins
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for...
Jia-yu Pan, Hyungjeong Yang, Christos Faloutsos, Pinar Duygulu
Multimedia objects like video clips or captioned images contain data of various modalities such as image, audio, and transcript text. Correlations across different modalities provide infor-mation...
Byoung-kee Yi, H. V. Jagadish, Christos Faloutsos, Presentation Jeff Feasel
• Find all s i that look like q
Fundamentals of scheduling and performance of video tape libraries (2008)
Costas Georgiadis, Peter Triantafillou, Christos Faloutsos
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a new scheduling...
Christos Faloutsos, Sigmod Copyright, C. Faloutsos, Deepay Chakrabarti (cmu, Spiros Papadimitriou (cmu, ...
• Bursty traffic- fractals and multifractals
ABSTRACT Robust Information-theoretic Clustering (2008)
Christian Böhm, Christos Faloutsos, Jia-yu Pan, Claudia Plant
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clustering algorithms...
Why matrices are important? (2008)
Christos Faloutsos, Carnegie Mellon Univ, Tamara G. Kolda, Sandia National Labs, Jimeng Sun, Carnegie Mellon Univ, ...
About the tutorial • Introduce matrix and tensor tools through real mining applications Goal: find patterns, rules, clusters, outliers, … – in matrices and – in tensors
Multimedia queries by example and relevance feedback (2008)
Leejay Wu, Christos Faloutsos, Katia Sycara, Terry Payne
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Similarity Search without Tears: the OMNI-Family of All-Purpose Access Methods (2008)
Roberto Figueira, Santos Filho, Agma Traina, Caetano Traina, Jr. Christos Faloutsos
Designing a new access method inside a commercial DBMS is cumbersome and expensive. We propose a family of metric access methods that are fast and easy to implement on top of existing access methods,...
Visualization of Large Networks with Min-cut Plots, A-plots and R-MAT ⋆,⋆⋆ (2008)
Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan
What does a ‘normal ’ computer (or social) network look like? How can we spot ‘abnormal ’ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier...
School of Computer Science Carnegie Mellon Finding Patterns in Large Graphs (2008)
Christos Faloutsos, Nips C. Faloutsos
• Introduction- motivation • Problem #1: Patterns in the internet topology
Data Mining General Terms Design, Experimentation (2008)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Given an image (or video clip, or audio song), how do we automatically assign keywords to it? The general problem is to find correlations across the media in a collection of multimedia objects like...
Flip Korn, Ros Labrinidis, Yannis Kotidis, Christos Faloutsos
a data matrix (e.g., customers products) to derive association rules (Agrawal, Imielinski, & Swami, 1993b; Srikant & Agrawal, 1996). We propose a new paradigm, namely, Ratio Rules, which are...
Fundamentals of scheduling and performance of video tape libraries (2008)
Costas Georgiadis, Peter Triantafillou, Christos Faloutsos
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a new scheduling...
Byoung-kee Yi, Christos Faloutsos
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean distance and its...
GMine: A System for Scalable, Interactive Graph Visualization and Mining (2008)
José F. Rodrigues, Hanghang Tong, Christos Faloutsos, Jure Leskovec
Several graph visualization tools exist. However, they are not able to handle large graphs, and/or they do not allow interaction. We are interested on large graphs, with hundreds of thousands of...
On the ªDimensionality Curseº and the ªSelf-Similarity Blessingº (2008)
AbstractÐSpatial queries in high-dimensional spaces have been studied extensively recently. Among them, nearest-neighbor queries are important in many settings, including spatial databases (Find the...
ABSTRACT Cost-effective Outbreak Detection in Networks Jure Leskovec (2008)
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly different problems...
ABSTRACT Automatic Mining of Fruit Fly Embryo Images ∗ (2008)
Jia-yu Pan, André Guilherme, Ribeiro Balan, Eric P. Xing, Agma Juci, Machado Traina, ...
We present FEMine, an automatic system for image-based gene expression analysis. We perform experiments on the largest publicly available collection of Drosophila ISH (in situ hybridization) images,...
NetProbe: A Fast and Scalable System for Fraud Detection (2008)
Shashank P, Duen Horng Chau, Samuel Wang, Christos Faloutsos
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe,...
Sun Icml, Christos Faloutsos, Carnegie Mellon Univ, Tamara G. Kolda, Sandia National Labs, Jimeng Sun, ...
About the tutorial • Introduce matrix and tensor tools through real mining applications • Goal: find patterns, rules, clusters, outliers, … – in matrices and – in tensors
Abstract Data Mining on an OLTP System (Nearly) for Free (2008)
Erik Riedel, Christos Faloutsos, Gregory R. Ganger, David F. Nagle
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that such a scheme makes...
Power Laws, Christos Faloutsos, C. Faloutsos, C. Faloutsos, Prof Rong Jin, ...
• Goals / motivation: find patterns in large datasets: – (A) Sensor data – (B) network/graph data
Kaushik Chakrabarti, Michael Ortega, Kriengkrai Porkaew, Sharad Mehrotra, Leejay Wu, Christos Faloutsos, ...
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and...
WWW 2007 / Poster Paper Topic: Social Networks Parallel Crawling for Online Social Networks (2008)
Duen Horng Chau, Shashank P, Samuel Wang, Christos Faloutsos
Given a huge online social network, how do we retrieve information from it through crawling? Even better, how do we improve the crawling performance by using parallel crawlers that work...
Spatial Query Estimation without the Local Uniformity Assumption (2008)
Yufei Tao, Christos Faloutsos, Dimitris Papadias, Y. Tao
Abstract Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their...
Yannis Manolopoulos, Christos Faloutsos
Two new pattern-matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character...
Shashank P, Duen Horng Chau, Samuel Wang, Christos Faloutsos
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe,...
ABSTRACT Cost-effective Outbreak Detection in Networks Jure Leskovec (2008)
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly different problems...
Data Mining General Terms (2008)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Given an image (or video clip, or audio song), how do we automatically assign keywords to it? The general problem is to find correlations across the media in a collection of multimedia objects like...
Epidemic Thresholds in Real Networks (2008)
Deepayan Chakrabarti, Yang Wang, Chenxi Wang, Jure Leskovec, Christos Faloutsos
How will a virus propagate in a real network? How long does it take to disinfect a network given particular values of infection rate and virus death rate? What is the single best node to immunize?...
Modeling Bursty Traffic (2008)
Mengzhi Wang, Spiros Papadimitriou, Tara Madhyastha, Christos Faloutsos, Ngai Hang Chan
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
Intelligent System Monitoring on Large Clusters (2008)
Jimeng Sun, Evan Hoke, John D. Strunk, Gregory R. Ganger, Christos Faloutsos
Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype...
Abstract Finding patterns in blog shapes and blog evolution (2008)
Mary Mcglohon, Jure Leskovec, Christos Faloutsos, Matthew Hurst, Natalie Glance
Can we cluster blogs into types by considering their typical posting and linking behavior? How do blogs evolve over time? In this work we answer these questions, by providing several sets of blog and...
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
This work explores the application of a machine learning tool, CART modeling, to storage devices. We have developed approaches to predict a device’s performance as a function of input workloads,...
On data mining, compression, and Kolmogorov complexity (2008)
Christos Faloutsos, Vasileios Megalooikonomou
Abstract Will we ever have a theory of data mining analogous to the relational algebra in databases? Why do we have so many clearly different clustering algorithms? Could data mining be automated? We...
ABSTRACT Fast Discovery of Connection Subgraphs (2008)
Christos Faloutsos, Kevin S. Mccurley, Andrew Tomkins
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a paradigm for...
%% [ ProductName: ESP Ghostscript]%% (2008)
Erik Riedel, Christos Faloutsos, Gregory R. Ganger, David F. Nagle
Abstract This paper proposes a scheme for scheduling disk requests thattakes advantage of the ability of high-level functions to operate
ABSTRACT Robust Information-theoretic Clustering (2008)
Christian Böhm, Christos Faloutsos, Jia-yu Pan, Claudia Plant
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clustering algorithms...
Intemon: continuous mining of sensor data in largescale self-infrastructures (2008)
Evan Hoke, Jimeng Sun, John D. Strunk, Gregory R. Ganger, Christos Faloutsos
Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype...
Automatic Mining of Fruit Fly Embryo Images (2008)
Jia-yu Pan, André Guilherme, Ribeiro Balan, Eric P. Xing, Agma Juci, ...
We present FEMine, an automatic system for image-based gene expression analysis. We perform experiments on the largest publicly available collection of Drosophila ISH (in situ hybridization) images,...
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations (2008)
Jure Leskovec, Jon Kleinberg, Christos Faloutsos
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs,...
AWSOM: Adaptive, Hands-Off Stream Mining (2008)
Spiros Papadimitriou, Anthony Brockwell, Christos Faloutsos
Sensor devices and embedded processors are becoming ubiquitous, especially in measurement and monitoring applications. Automatic discovery of patterns and trends in the large volumes of such data is...
Monitoring Network Evolution using MDL. (2008)
Ferlez, Jure, Faloutsos, Christos, Leskovec, Jure, Mladenić, Dunja, Grobelnik, Marko
Given publication titles and authors, what can we say about the evolution of scientific topics and communities over time? Which communities shrunk, which emerged, and which split, over time? And,...
Mobile Call Graphs: Beyond Power-Law and Lognormal Distributions (2008)
Mukund, Seshadri, Machiraju, Sridhar, Sridharan, Ashwin, Bolot, Jean, Faloutsos, Christos, Leskovec, Jure
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distributions of the...
Hanghang Tong, Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos Fast, Hanghang Tong, ...
Zhang. Manifold-Ranking Based Keyword Propagation for Image Retrieval. EURASIP
Proximity tracking on time-evolving bipartite graphs (2008)
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu, Christos Faloutsos
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time-evolving bipartite...
Protein complex identification by supervised graph local clustering (2008)
Qi, Yanjun, Balem, Fernanda, Faloutsos, Christos, Klein-Seetharaman, Judith, Bar-Joseph, Ziv
Motivation: Protein complexes integrate multiple gene products to coordinate many biological functions. Given a graph representing pairwise protein interaction data one can search for subgraphs...
Analysis of the n-dimensional quadtree (2007)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos
decomposition for arbitrary hyper-rectangles
Flip Korn AT&T Labs-Research (2007)
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previous analyses have...
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance....
Quantifiable Data Mining Using Ratio Rules (2007)
Flip Korn, Alexandros Labrinidis, Yannis Kotidis, Christos Faloutsos
Association Rule Mining algorithms operate on a data matrix (e.g., customers \Theta products) to derive association rules (Agrawal, Imielinski, & Swami, 1993b; Srikant & Agrawal, 1996). We...
December Vol No, Letter Editor-in-chief, David Lomet, Letter Special, Christos Faloutsos, Peter J. Haas, ...
this paper we describe and evaluate several popular techniques for data reduction.
: The Data Mining Project at ATT Research (2007)
Stefan Berchtold, Christos Faloutsos, H. V. Jagadish, Theodore Johnson, Raymond Ng, Ken Ross
Revision : 6:1 The goal of this white paper is to define research directions. We start with the problem definition, present a classification of tools and issues, and list completed or on-going...
Moderator Nicholas, Moderator Nicholas Declaris, Christos Faloutsos, Susan Dumais
This paper is intended to serve as a springboard for a panel discussion with audience participation on information filtering and retrieval. Medical informatics is an emerging specialty which links...
Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos
christoscs. cmu. edu Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene...
We introduce ImageMap, as a method for indexing and similarity searching in Image DataBases (IDBs). ImageMap answers “queries by example”, involving any number of objects or regions and taking...
Costas Georgiadis, Peter Triantafillou, Christos Faloutsos
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a new scheduling...
We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by attributed relational graphs holding features of objects and...
Vikrant Kobla, David Doermann, Christos Faloutsos
A high-level representation of a video clip comprising information about its physical and semantic structure is necessary for providing appropriate processing, indexing and retrieval capabilities for...
Fast Approximation of the “Neighbourhood ” Function for Massive Graphs (2007)
Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos
The neighbourhood function, N(h), is the number of pairs of nodes that are within dis-tance h. The neighbourhood function provides useful information for graphs such as the struc-ture of XML...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability distribution, the...
Similarity Search without Tears: the OMNI-Family of All-Purpose Access Methods (2007)
Roberto Figueira, Santos Filho, Agma Traina, Caetano Traina, Jr. Christos Faloutsos
Designing a new access method inside a commercial DBMS is cumbersome and expensive. We propose a family of metric access methods that are fast and easy to implement on top of existing access methods,...
Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Papadimitriou, Christos Faloutsos
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
Announcements and Notices (2007)
Kaushik Chakrabarti, Michael Ortega, Kriengkrai Porkaew, Sharad Mehrotra, Leejay Wu, Christos Faloutsos, ...
TCDE Election Notice and Position Statement.................................................... 50 TCDE Election Ballot.................................................................... back cover...
Multimedia queries by example and relevance feedback (2007)
Leejay Wu, Christos Faloutsos, Katia Sycara, Terry Payne
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Papadimitriou, Christos Faloutsos
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
Agma Traina, Leejay Wu, Christos Faloutsos
and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. Fast feature selection using...
Multimedia System: A system that can store and retrieve objects/documents with text, voice, images,
The VLDB Journal manuscript No. (2007)
Will Be Inserted, Alexandros Labrinidis, Yannis Kotidis, Christos Faloutsos
Association Rule Mining algorithms operate on a data matrix (e.g., customers \Theta products) to derive association rules (Agrawal, Imielinski, & Swami, 1993b; Srikant & Agrawal, 1996). We...
Hiroyuki Kitawaga, Spiros Papadimitriou, Spiros Papadimitriou, Phillip B. Gibbons, Phillip B. Gibbons, Hiroyuki Kitagawa, ...
Outlier detection is an integral part of data mining and has attracted much attention recently [8, 15, 20]. In this paper, we propose a new method for evaluating outlier-ness, which we call the Local...
Cascading Behavior in Large Blog Graphs (2007)
Leskovec, Jure, McGlohon, Mary, Faloutsos, Christos, Glance, Natalie, Hurst, Matthew
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
Feature Normalization for Video Indexing and Retrieval (2007)
Kobla, Vikrant, Doermann, David, Lin, King-Ip, Faloutsos, Christos
Fast and efficient storage, browsing, indexing, and retrieval of video is necessary for the development of various multimedia database applications. Given that video is typically stored efficiently...
Tri-Plots: Scalable Tools for Multidimensional Data Mining (2007)
Traina, Agma, Traina, Caetano, Papadimitriou, Spiros, Faloutsos, Christos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
Cascading behavior in large blog graphs (2007)
Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, Matthew Hurst
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
• Financial, sales, economic series (2007)
Time Series Mining, Christos Faloutsos, Deepay Chakrabarti (cmu, Spiros Papadimitriou (cmu, Mengzhi Wang (cmu, ...
• Similarity search – distance functions
Learning to Adapt Across Multimedia Domains (2007)
Jun Yang, Christos Faloutsos, Jie Yang
In multimedia, machine learning techniques are often applied to build models to map low-level feature vectors into semantic labels. As data such as images and videos come from a variety of domains...
Information survival threshold in sensor and P2P networks (2007)
Deepayan Chakrabarti, Jure Leskovec, Christos Faloutsos, Samuel Madden, Carlos Guestrin, Michalis Faloutsos
Abstract—Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down. Consider...
Fast best-effort pattern matching in large attributed graphs (2007)
Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-rad
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person’s job title. In such a setting, we want to find subgraphs that match a...
Information survival threshold in sensor and P2P networks (2007)
Deepayan Chakrabarti, Jure Leskovec, Christos Faloutsos, Samuel Madden, Carlos Guestrin, Michalis Faloutsos
Abstract—Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down. Consider...
Cost-effective Outbreak Detection in Networks Jure Leskovec ∗ Andreas Krause ∗ (2007)
Carlos Guestrin, Christos Faloutsos, Jeanne Vanbriesen, Natalie Glance
functions Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly...
Cascading behavior in large blog graphs (2007)
Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, Matthew Hurst
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
Scalable modeling of real graphs using kronecker multiplication (2007)
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to...
Information survival threshold in sensor and P2P networks (2007)
Deepayan Chakrabarti, Jure Leskovec, Christos Faloutsos, Samuel Madden, Carlos Guestrin, Michalis Faloutsos
Abstract — Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down. Consider...
ABSTRACT Full-Text Federated Search in Peer-to-Peer Networks (2007)
Jie Lu, Jaime Carbonell, Christos Faloutsos, Jie Lu
Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalable model for providing...
Information survival threshold in sensor and P2P networks (2007)
Deepayan Chakrabarti, Jure Leskovec, Christos Faloutsos, Samuel Madden, Carlos Guestrin, Michalis Faloutsos
Abstract — Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down. Consider...
Less is more: Compact matrix decomposition for large sparse graphs (2007)
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Faloutsos
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, research citation network...
Cost-effective Outbreak Detection in Networks Jure Leskovec ∗ Andreas Krause ∗ (2007)
Carlos Guestrin, Christos Faloutsos, Jeanne Vanbriesen, Natalie Glance
functions Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly...
Scalable modeling of real graphs using kronecker multiplication (2007)
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to...
Fast best-effort pattern matching in large attributed graphs (2007)
Hanghang Tong, Brian Gallagher, Christos Faloutsos, Tina Eliassi-rad
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person’s job title. In such a setting, we want to find subgraphs that match a...
Less is more: Compact matrix decomposition for large sparse graphs (2007)
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Faloutsos
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, research citation network...
Cost-effective Outbreak Detection in Networks Jure Leskovec ∗ Andreas Krause ∗ (2007)
Christos Faloutsos, Jeanne Vanbriesen, Natalie Glance, Carlos Guestrin, Christos Faloutsos, Jeanne Vanbriesen, ...
functions Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly...
Finding Patterns in Blog Shapes and Blog Evolution (2007)
Mary Mcglohon, Jure Leskovec, Christos Faloutsos, Matthew Hurst, Natalie Glance, Mary Mcglohon, ...
Can we cluster blogs into types by considering their typical posting and linking behavior? How do blogs evolve over time? In this work we answer these questions, by providing several sets of blog and...
Cost-effective Outbreak Detection in Networks (2007)
Leskovec, Jure, Krause, Andreas, Guestrin, Carlos, Faloutsos, Christos, VanBriesen, Jeanne, Glance, Natalie
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly different problems...
Cascading behavior in large blog graphs (2007)
Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, Matthew Hurst
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
CMU-ML-07-112 ADAGE: A software package for analyzing graph evolution (2007)
Mary Mcglohon, Christos Faloutsos, Mary Mcglohon, Christos Faloutsos
Understanding common properties in time-evolving graphs is useful for gaining important information about specific networks. Certain graph properties may provide a better understanding of how a...
Scalable modeling of real graphs using Kronecker multiplication (2007)
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum, etc? We propose to...
Spatial query estimation without the local uniformity assumption (2006)
Tao, Yufei, Faloutsos, Christos, Papadias, Dimitris
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their applicability is...
Graph Evolution: Densification and Shrinking Diameters (2006)
Leskovec, Jure, Kleinberg, Jon, Faloutsos, Christos
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying...
Data Mining on an OLTP System (Nearly) for Free (2006)
Riedel, Erik, Faloutsos, Christos, Ganger, Greg, Nagle, David
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that such a scheme makes...
Intemon: Intelligent system monitoring on large clusters (2006)
Evan Hoke, Jimeng Sun, Christos Faloutsos
InteMon is a prototype monitoring and mining system for large clusters. Currently, it monitors over 100 hosts of a prototype data center at CMU. It uses the SNMP protocol and it stores the monitoring...
Laws of Graph Evolution: Densification and Shrinking Diameters (2006)
Jure Leskovec, Jon Kleinberg, Christos Faloutsos
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs,...
InteMon: Continuous Mining of Sensor Data in Large-scale Self-* Infrastructures (2006)
Evan Hoke, Jimeng Sun, John D. Strunk, Gregory R. Ganger, Christos Faloutsos
Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon, a prototype...
Cascading behavior in large blog graphs: Patterns and a model (2006)
Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, Matthew Hurst
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
Graph evolution: Densification and shrinking diameters (2006)
Jon Kleinberg, Christos Faloutsos
How do real graphs evolve over time? What are normal growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties...
Detecting fraudulent personalities in networks of online auctioneers (2006)
Duen Horng Chau, Shashank P, Christos Faloutsos
Abstract. Online auctions have gained immense popularity by creating an accessible environment for exchanging goods at reasonable prices. Not surprisingly, malevolent auction users try to abuse them...
Beyond streams and graphs: Dynamic tensor analysis (2006)
Jimeng Sun, Dacheng Tao, Christos Faloutsos
How do we find patterns in author-keyword associations, evolving over time? Or in DataCubes, with product-branchcustomer sales information? Matrix decompositions, like principal component analysis...
Intemon: Intelligent system monitoring on large clusters (2006)
Evan Hoke, Jimeng Sun, Christos Faloutsos
InteMon is a prototype monitoring and mining system for large clusters. Currently, it monitors over 100 hosts of a prototype data center at CMU. It uses the SNMP protocol and it stores the monitoring...
Trail Re-identification and Unlinkability in Distributed Databases (2006)
Bradley Malin, Kathleen M. Carley, Christos Faloutsos
the United States government, nor its funding agencies.
Graph mining: Laws, generators, and algorithms (2006)
Deepayan Chakrabarti, Christos Faloutsos
How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph;...
Graph mining: Laws, generators, and algorithms (2006)
Deepayan Chakrabarti, Christos Faloutsos
How does the Web look? How could we tell an abnormal social network from a normal one? These and similar questions are important in many fields where the data can intuitively be cast as a graph;...
Graph evolution: Densification and shrinking diameters (2006)
Jon Kleinberg, Christos Faloutsos
How do real graphs evolve over time? What are “normal ” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying...
Distributed Pattern Discovery in Multiple Streams (2006)
Jimeng Sun, Spiros Papadimitriou, Christos Faloutsos
and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, or other funding parties.
Distributed Pattern Discovery in Multiple Streams (2006)
Jimeng Sun, Spiros Papadimitriou, Christos Faloutsos
Abstract. Given m groups of streams which consist of n1,..., nm coevolving streams in each group, we want to: (i) incrementally find local patterns within a single group, (ii) efficiently obtain...
Cascading behavior in large blog graphs: Patterns and a model (2006)
Jure Leskovec, Jure Leskovec, Mary Mcglohon, Mary Mcglohon, Christos Faloutsos, Christos Faloutsos, ...
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
Cascading behavior in large blog graphs: Patterns and a model (2006)
Jure Leskovec, Mary Mcglohon, Christos Faloutsos, Natalie Glance, Matthew Hurst
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we address in this work....
Leskovec, Jure, Chakrabarti, Deepay, Kleinberg, Jon, Faloutsos, Christos
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs obey a long list...
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations (2005)
Leskovec, Jure, Kleinberg, Jon, Faloutsos, Christos
How do real graphs evolve over time? What are ``normal'' growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying...
On Multidimensional Data and Modern Disks (2005)
Schlosser, Steven W., Schindler, Jiri, Papadomanolakis, Stratos, Shao, Minglong, Ailamaki, Anastassia, Faloutsos, Christos, ...
With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in...
Jurij Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos
Abstract. How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs obey a...
On multidimensional data and modern disks (2005)
Steven W. Schlosser, Jiri Schindler, Stratos Papadomanolakis, Minglong Shao, Anastassia Ailamaki, Christos Faloutsos, ...
With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in...
Neighborhood formation and anomaly detection in bipartite graphs (2005)
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific...
Neighborhood formation and anomaly detection in bipartite graphs (2005)
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific...
Relevance search and anomaly detection in bipartite graphs (2005)
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific...
Parameter-free spatial data mining using MDL (2005)
Spiros Papadimitriou, Aristides Gionis, Panayiotis Tsaparas, Risto A. Väisänen, Heikki Mannila, Christos Faloutsos
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatial correlation and...
Parameter-free spatial data mining using MDL (2005)
Spiros Papadimitriou, Aristides Gionis, Panayiotis Tsaparas, Risto A. Väisänen, Heikki Mannila, Christos Faloutsos
Consider spatial data consisting of a set of binary features taking values over a collection of spatial extents (grid cells). We propose a method that simultaneously finds spatial correlation and...
Neighborhood formation and anomaly detection in bipartite graphs (2005)
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific...
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations (2005)
Jurij Leskovec, Jon Kleinberg, Christos Faloutsos
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs,...
Realistic, Mathematically Tractable Graph (2005)
Generation And Evolution, Jurij Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs obey a long list...
On Multidimensional Data and Modern Disks (2005)
Steven W. Schlosser, Jiri Schindler, Stratos Papadomanolakis, Minglong Shao, Anastassia Ailamaki, Christos Faloutsos, ...
With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in...
Compact Data Structures with Fast Queries (2005)
Daniel K. Blandford, Christos Faloutsos, Danny Sleator
Many applications dealing with large data structures can benefit from keeping them in compressed form. Compression has many benefits: it can allow a representation to fit in main memory rather than...
Streaming Pattern Discovery in Multiple Time-Series (2005)
Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos
In this paper, we introduce SPIRIT (Streaming Pattern dIscoveRy in multIple Timeseries) . Given n numerical data streams, all of whose values we observe at each time tick t, SPIRIT can incrementally...
A multiresolution symbolic representation of time series (2005)
Vasileios Megalooikonomou, Qiang Wang, Guo Li, Christos Faloutsos
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a new representation...
Redesigning Database Systems in Light of CPU Cache Prefetching (2005)
Shimin Chen, Todd C. Mowry, Christos Faloutsos, Phillip B. Gibbons
through a generous fellowship. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or...
MultiMap: Preserving disk locality for multidimensional datasets (2005)
Minglong Shao, Steven W. Schlosser, Stratos Papadomanolakis, Jiri Schindler, Anastassia Ailamaki, Christos Faloutsos, ...
MultiMap is a new approach to mapping multidimensional datasets to the linear address space of storage systems. MultiMap exploits modern disk characteristics to provide full streaming bandwidth for...
Compact Data Structures with Fast Queries (2005)
Daniel K. Blandford, Christos Faloutsos, Danny Sleator
Many applications dealing with large data structures can benefit from keeping them in compressed form. Compression has many benefits: it can allow a representation to fit in main memory rather than...
Streaming pattern discovery in multiple time-series (2005)
Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos
In this paper, we introduce SPIRIT (Streaming Pattern dIscoveRy in multIple Timeseries). Given n numerical data streams, all of whose values we observe at each time tick t, SPIRIT can incrementally...
Fraud detection in electronic auction (2005)
Duen Horng Chau, Christos Faloutsos
Abstract. Auction frauds plague electronic auction websites. Unfortunately, no literature has tried to formulate and solve the problem. This paper aims to tackle it by suggesting a novel method to...
Relevance search and anomaly detection in bipartite graphs (2005)
Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific...
Online latent variable detection in sensor networks (2005)
Jimeng Sun, Spiros Papadimitriou, Christos Faloutsos
Sensor networks attract increasing interest, for a broad range of applications. Given a sensor network, one key issue becomes how to utilize it efficiently and effectively. In particular, how can we...
Jurij Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos
Abstract. How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs obey a...
Approximate temporal aggregation (2004)
Tao, Yufei, Papadias, Dimitris, Faloutsos, Christos
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) they incur large space...
Storage device performance prediction with CART models (2004)
Wang, Mengzhi, Au, Kinman, Ailamaki, Anastassia, Brockwell, Anthony, Faloutsos, Christos, Ganger, Gregory R.
Fully automatic cross-associations (2004)
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos
Large, sparse binary matrices arise in numerous data mining applications, such as the analysis of market baskets, web graphs, social networks, co-citations, as well as information retrieval,...
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction is a key element of self-managed storage systems and application planning tasks, such as data assignment. This work explores the application of a machine...
Automatic image captioning (2004)
Jia-yu Pan, Hyung-jeong Yang, Pinar Duygulu, Christos Faloutsos
In this paper, we examine the problem of automatic image captioning. Given a training set of captioned images, we want to discover correlations between
Gcap: Graph-based automatic image captioning (2004)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Given an image, how do we automatically assign keywords to it? In this paper, we propose a novel, graph-based approach (GCap) which outperforms previously reported methods for automatic image...
Auditing Compliance with a Hippocratic Database (2004)
Rakesh Agrawal, Roberto Bayardo, Christos Faloutsos, Jerry Kiernan, Ralf Rantzau, Ramakrishnan Srikant
We introduce an auditing framework for determining whether a database system is adhering to its data disclosure policies. Users formulate audit expressions to specify the (sensitive) data subject to...
Automatic image captioning (2004)
Jia-yu Pan, Hyung-jeong Yang, Pinar Duygulu, Christos Faloutsos
In this paper, we examine the problem of automatic image captioning. Given a training set of captioned images, we want to discover correlations between
Automated assistance for eliciting user expectations (2004)
Orna Raz, Rebecca Buchheit, Mary Shaw, Philip Koopman, Christos Faloutsos
People often use software for mundane tasks and expect it to be dependable enough for their needs. Unfortunately, the incomplete and imprecise specifications of such everyday software inhibit many...
Autosplit: Fast and scalable discovery of hidden variables in stream and multimedia databases (2004)
Jia-yu Pan, Hiroyuki Kitagawa, Christos Faloutsos
, and Masafumi
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction is a key element of self-managed storage systems. This work explores the application of a machine learning tool, CART models, to storage device modeling. Our...
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction is a key element of self-managed storage systems and application planning tasks, such as data assignment. This work explores the application of a machine...
N etM ine: New Mining Tools for Large Graphs (2004)
Deepayan Chakrabarti, Yiping Zhan, Daniel Bl, Christos Faloutsos, Guy Blelloch
Discovering patterns, laws and regularities in large real networks has numerous applications: Analysis of virus propagation patterns, on both social/e-mail as well as physical-contact networks [33];...
Gcap: Graph-based automatic image captioning (2004)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Abstract Given an image, how do we automatically assign keywordsto it? In this paper, we propose a novel, graph-based approach (GCap) which outperforms previously reportedmethods for automatic image...
Approximate Temporal Aggregation (2004)
Yufei Tao, Dimitris Papadias, Christos Faloutsos
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) they incur large space...
Automatic Multimedia Cross-modal Correlation Discovery (2004)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Given an image (or video clip, or audio song), how do we automatically assign keywords to it? The general problem is to find correlations across the media in a collection of multimedia objects like...
Fractal Dimension and Vector Quantization (2004)
Krishna Kumaraswamy, Vasileios Megalooikonomou, Christos Faloutsos
We show that the performance of a vector quantizer for a self-similar data set is related to the intrinsic ("fractal") dimension of the data set. We derive a formula for predicting the...
Segmenting Motion Capture Data into Distinct Behaviors (2004)
Jernej Barbic, Alla Safonova, Jia-Yu Pan, Christos Faloutsos, Jessica K. Hodgins, Nancy S. Pollard
Much of the motion capture data used in animations, commercials, and video games is carefully segmented into distinct motions either at the time of capture or by hand after the capture session. As we...
Prediction and indexing of moving objects with unknown motion patterns (2004)
Yufei Tao, Christos Faloutsos, Dimitris Papadias, Bin Liu
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more...
Prediction and indexing of moving objects with unknown motion patterns (2004)
Yufei Tao, Christos Faloutsos, Dimitris Papadias, Bin Liu
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice movement is more...
R-MAT: A recursive model for graph mining (2004)
Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos
How does a ‘normal ’ computer (or social) network look like? How can we spot ‘abnormal ’ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier...
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction is a key element of self-managed storage systems and application planning tasks, such as data assignment. This work explores the application of a machine...
Fully automatic cross-associations (2004)
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos
Large, sparse binary matrices arise in numerous data mining applications, such as the analysis of market baskets, web graphs, social networks, co-citations, as well as information retrieval,...
Obe: Outlier by example (2004)
Cui Zhu, Hiroyuki Kitagawa, Spiros Papadimitriou, Christos Faloutsos
Abstract. Outlier detection in large datasets is an important problem. There are several recent approaches that employ very reasonable definitions of an outlier. However, a fundamental issue is that...
Fully automatic cross-associations (2004)
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos
Large, sparse binary matrices arise in numerous data mining applications, such as the analysis of market baskets, web graphs, social networks, co-citations, as well as information retrieval,...
Automatic multimedia cross-modal correlation discovery (2004)
Jia-yu Pan, Hyungjeong Yang, Pinar Duygulu, Christos Faloutsos
Categories and Subject
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction with CART models (2004)
Mengzhi Wang, Kinman Au, Anastassia Ailamaki, Anthony Brockwell, Christos Faloutsos, Gregory R. Ganger
Storage device performance prediction is a key element of self-managed storage systems. This work explores the application of a machine learning tool, CART models, to storage device modeling. Our...
R-MAT: A recursive model for graph mining (2004)
Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos
How does a ‘normal ’ computer (or social) network look like? How can we spot ‘abnormal ’ sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier...
Gcap: Graph-based automatic image captioning (2004)
Jia-yu Pan, Hyung-jeong Yang, Christos Faloutsos, Pinar Duygulu
Given an image, how do we automatically assign keywords to it? In this paper, we propose a novel, graph-based approach (GCap) which outperforms previously reported methods for automatic image...
Automated assistance for eliciting user expectations (2004)
Orna Raz, Rebecca Buchheit, Mary Shaw, Philip Koopman, Christos Faloutsos
People often use software for mundane tasks and expect it to be dependable enough for their needs. Unfortunately, the incomplete and imprecise specifications of such everyday software inhibit many...
Segmenting motion capture data into distinct behaviors (2004)
Jernej Barbič, Alla Safonova, Jia-yu Pan, Christos Faloutsos, Jessica K. Hodgins, Nancy S. Pollard
Much of the motion capture data used in animations, commercials, and video games is carefully segmented into distinct motions either at the time of capture or by hand after the capture session. As we...
Detecting semantic anomalies in truck weigh-in-motion traffic data using data mining (2004)
Orna Raz, Rebecca Buchheit, Mary Shaw, Philip Koopman, Christos Faloutsos
Monitoring data from event-based monitoring systems are becoming more and more prevalent in civil engineering. An example is truck weigh-in-motion (WIM) data. These data are used in the...
Indexing and mining streams (2004)
How can we find patterns in a sequence of sensor measurements (eg., a sequence of temperatures, or water-pollutant measurements)? How can we compress it? What are the major tools for forecasting and...
Edoardo Airoldi, Christos Faloutsos
from Intel, and by a gift from Northrop-Grumman Corporation. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily...
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, Christos Faloutsos
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, or other...
Christos Faloutsos, Deepay Chakrabarti (cmu, Spiros Papadimitriou (cmu, Mengzhi Wang (cmu
• Bursty traffic- fractals and multifractals
Eliciting user expectations for data behavior via invariant templates (2003)
Orna Raz, Rebecca Buchheit, Mary Shaw, Philip Koopman, Christos Faloutsos
People expect software that they use for everyday purposes to be dependable enough for their needs. Usually, they can tolerate some failures, provided they can notice and recover from problems. Many...
Eliciting user expectations for data behavior via invariant templates (2003)
Orna Raz, Rebecca Buchheit, Mary Shaw, Philip Koopman, Christos Faloutsos
People expect software that they use for everyday purposes to be dependable enough for their needs. Usually, they can tolerate some failures, provided they can notice and recover from problems. Many...
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint (2003)
Yang Wang, Deepayan Chakrabarti, Chenxi Wang, Christos Faloutsos
Abstract How will a virus propagate in a real network?Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does ittake to disinfect a network given particular...
Power-laws and the AS-level Internet topology (2003)
Georgos Siganos, Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos
Abstract | In this paper, we study and characterize the topology of the Internet at the Autonomous System level. First, we show that the topology can be described eciently with power-laws. The...
Detecting discriminative functional MRI activation patterns using space filling curves (2003)
Despina Kontos, Vasileios Megalooikonomou, D. Kontos, Christos Faloutsos, V. Megalooikonomou, Nilesh Ghubade, ...
INTRODUCTION The detection of relationships between human brain structures and brain functions (i.e., human brain mapping) has been recognized as one of the main goals of the Human Brain Project [1]....
Power-laws and the AS-level Internet topology (2003)
Georgos Siganos, Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos
Adaptive, hands-off stream mining (2003)
Spiros Papadimitriou, Anthony Brockwell, Christos Faloutsos
Sensor devices and embedded processors are becoming ubiquitous, especially in measurement and monitoring applications. Automatic discovery of patterns and trends in the large volumes of such data is...
LOCI: Fast outlier detection using the local correlation integral (2003)
Spiros Papadimitriou, Hiroyuki Kitagawa, Christos Faloutsos, Phillip B. Gibbons
Outlier detection is an integral part of data mining and has attracted much attention recently [8, 15, 19]. In this paper, we propose a new method for evaluating outlierness, which we call the Local...
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint (2003)
Yang Wang, Deepayan Chakrabarti, Chenxi Wang, Christos Faloutsos
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network given particular values...
A Case for Staged Database Systems (2003)
Stavros Harizopoulos, Panos K. Chrysanthis, Christos Faloutsos, Todd C. Mowry
not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the U.S. government or any other entity.
LOCI: Fast outlier detection using the local correlation integral (2003)
Spiros Papadimitriou, Hiroyuki Kitagawa, Phillip B. Gibbons, Christos Faloutsos
under Contract No. N66001-00-1-8936. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the...
The powermethod: A comprehensive estimation technique for multi-dimensional queries (2003)
Yufei Tao, Christos Faloutsos, Dimitris Papadias
Existing estimation approaches for multi-dimensional databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their...
Cross-outlier detection (2003)
Spiros Papadimitriou, Christos Faloutsos
Abstract. The problem of outlier detection has been studied in the context of several domains and has received attention from the database research community. To the best of our knowledge, work up to...
The powermethod: A comprehensive estimation technique for multi-dimensional queries (2003)
Yufei Tao, Christos Faloutsos, Dimitris Papadias
Existing estimation approaches for multi-dimensional databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their...
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint (2003)
Yang Wang, Deepayan Chakrabarti, Christos Faloutsos, Chenxi Wang, Chenxi Wang
How will a virus propagate in a real network? Does an epidemic threshold exist for a nite power-law graph, or any nite graph? How long does it take to disinfect a network given particular values of...
Adaptive, hands-off stream mining (2003)
Spiros Papadimitriou, Anthony Brockwell, Christos Faloutsos
under Contract No. N66001-00-1-8936. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the...
The powermethod: A comprehensive estimation technique for multi-dimensional queries (2003)
Yufei Tao, Christos Faloutsos, Dimitris Papadias
Existing estimation approaches for multi-dimensional databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their...
Electricity based external similarity of categorical attributes (2003)
Christopher R. Palmer, Christos Faloutsos
Abstract. Similarity or distance measures are fundamental and critical properties for data mining tools. Categorical attributes abound in databases. The Car Make, Gender, Occupation, etc. fields in a...
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint (2003)
Yang Wang, Deepayan Chakrabarti, Chenxi Wang, Christos Faloutsos
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network given particular values...
LOCI: Fast outlier detection using the local correlation integral (2003)
Spiros Papadimitriou, Hiroyuki Kitagawa, Christos Faloutsos, Phillip B. Gibbons
Outlier detection is an integral part of data mining and has attracted much attention recently [8, 15, 19]. In this paper, we propose a new method for evaluating outlierness, which we call the Local...
Adaptive, Hands-O Stream Mining (2003)
Spiros Papadimitriou Anthony, Anthony Brockwell, Christos Faloutsos
Sensor devices and embedded processors are becoming ubiquitous. Their limited resources (CPU, memory and/or communication bandwidth and power) pose some interesting challenges.
Power-laws and the AS-level Internet topology (2003)
Georgos Siganos, Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos
Abstract — In this paper, we study and characterize the topology of the Internet at the Autonomous System level. First, we show that the topology can be described efficiently with power-laws. The...
Adaptive, hands-off stream mining (2003)
Spiros Papadimitriou, Anthony Brockwell, Christos Faloutsos
Sensor devices and embedded processors are becoming ubiquitous, especially in measurement and monitoring applications. Automatic discovery of patterns and trends in the large volumes of such data is...
An environmental sensor network to determine drinking water quality and security (2003)
Ailamaki, Anastassia, Faloutsos, Christos, Fischbeck, Paul S., Small, Mitchell J., VanBriesen, Jeanne
Capturing the spatio-temporal behavior of real traffic data (2002)
Mengzhi Wang, Anastassia Ailamaki, Christos Faloutsos
{mzwang, natassa, christos}cs. cmu. edu Traffic, like disk and memory accesses, typically exhibits burstiness, temporal locality and spatial locality. There is much recent ground-breaking work on...
Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic (2002)
Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Papadimitriou, Christos Faloutsos
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic (2002)
Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Papadimitriou, Christos Faloutsos
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
ANF: A Fast and Scalable (2002)
Tool For Data, Phillip B. Gibbons, Christos Faloutsos, Christopher R. Palmer, Christopher R. Palmer
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences, city streets,...
Capturing the Spatio-Temporal Behavior of Real Traffic Data (2002)
Mengzhi Wang, Anastassia Ailamaki, Christos Faloutsos
Traffic, like disk and memory accesses, typically exhibits burstiness, temporal locality and spatial locality. There is much recent ground-breaking work on temporal modeling (self-similarity etc), on...
Large-scale Automated Forecasting using Fractals (2002)
Deepayan Chakrabarti Christos, Christos Faloutsos
Forecasting has attracted a lot of research interest, with very successful methods for periodic time sequences. Here, we propose a fast, automated method to do non-linear forecasting, for both...
Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic (2002)
Mengzhi Wang, Tara Madhyastha, Ngai Hang Chan, Spiros Paradimitriou, Christos Faloutsos
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model these types of...
ANF: A Fast and Scalable Tool for Data Mining (2002)
In Massive Graphs, Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences, city streets,...
Making every bit count: Fast nonlinear axis scaling (2002)
Leejay Wu Lw, Leejay Wu, Christos Faloutsos
Existing axis scaling and dimensionality methods focus on preserving structure, usually determined via the Euclidean distance. In other words, they inherently assume that the Euclidean distance is...
F4: Large-Scale Automated Forecasting Using Fractals (2002)
Deepayan Chakrabarti, Christos Faloutsos
Forecasting has attracted a lot of research interest, with very successful methods for periodic time series. Here, we propose a fast, automated method to do non-linear forecasting, for both periodic...
ANF: A fast and scalable tool for data mining in massive graphs (2002)
Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences, city streets,...
Multimedia Queries by Example and Relevance Feedback (2001)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Multimedia Queries by Example and Relevance Feedback (2001)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Multimedia Queries by Example and Relevance Feedback (2001)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Analysis of the clustering properties of the Hilbert space-filling curve (2001)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
AbstractÐSeveral schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression....
The connectivity and fault-tolerance of the Internet topology (2001)
Christopher R. Palmer, Georgos Siganos, Michalis Faloutsos, Christos Faloutsos
In this paper, we apply data mining analysis to study the topology of the Internet, thus creating a new processing framework. To the best of our knowledge, this is one of the first studies that focus...
Tri-plots: Scalable tools for multidimensional data mining (2001)
Agma Traina, Caetano Traina, Spiros Papadimitriou, Christos Faloutsos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
Generalized Feature Extraction for Structural Pattern Recognition in Time-Series Data (2001)
Robert T. Olszewski, Christos Faloutsos, David Banks Dot
Pattern recognition encompasses two fundamental tasks: description and classification. Given an object to analyze, a pattern recognition system first generates a description of it (i.e., the pattern)...
Crosscloud plots: Scalable tools for spatial and multidimensional data mining (2001)
Agma Traina, Caetano Traina, Christos Faloutsos, Spiros Papadimitriou
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
Netcube: A scalable tool for fast data mining and compression (2001)
Dimitris Margaritis, Christos Faloutsos, Sebastian Thrun
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute values and...
VideoGraph: A new tool for video mining and classification (2001)
Jia-yu Pan, Christos Faloutsos
This paper introduces VideoGraph, a new tool for video mining and visualizing the structure of the plot of a video sequence. The main idea is to \stitch " together similar scenes which are...
Tri-plots: Scalable tools for multidimensional data mining (2001)
Agma Traina, Caetano Traina, Spiros Papadimitriou, Christos Faloutsos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
NetCube: A Scalable Tool for Fast Data Mining and Compression (2001)
Dimitris Margaritis, Christos Faloutsos, Sebastian Thrun
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute values and...
Tri-plots: Scalable tools for multidimensional data mining (2001)
Agma Traina, Caetano Traina, Spiros Papadimitriou, Christos Faloutsos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
Generalized Feature Extraction for Structural Pattern Recognition in Time-Series Data (2001)
Robert T. Olszewski, Christos Faloutsos, David Banks Dot
Pattern recognition encompasses two fundamental tasks: description and classification. Given an object to analyze, a pattern recognition system first generates a description of it (i.e., the pattern)...
Multimedia Queries by Example and Relevance Feedback (2001)
Leejay Wu Christos, Christos Faloutsos, Katia Sycara, Terry Payne
We describe the FALCON system for handling multimedia queries with relevance feedback. FALCON distinguishes itself in its ability to handle even disjunctive queries on metric spaces. Our experiments...
Netcube: A scalable tool for fast data mining and compression (2001)
Dimitris Margaritis, Christos Faloutsos, Sebastian Thrun
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute values and...
Analysis of the clustering properties of the Hilbert space-filling curve (2001)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
AbstractÐSeveral schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression....
Principal Investigator, Howard Wactlar, Christel Takeo Kanade, Christos Faloutsos, John Lafferty, Alexander Hauptmann, ...
The Informedia-II Project will change the paradigm for accessing digital video libraries through meaningful, manipulable overviews of video document sets, multimodal queries, and adaptive...
Principal Investigator, Howard Wactlar, Christel Takeo Kanade, Christos Faloutsos, John Lafferty, Alexander Hauptmann, ...
The Informedia-II Project will change the paradigm for accessing digital video libraries through meaningful, manipulable overviews of video document sets, multimodal queries, and adaptive...
Tri-plots: Scalable tools for multidimensional data mining (2001)
Agma Traina, Caetano Traina, Spiros Papadimitriou, Christos Faloutsos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
Tri-plots: Scalable tools for multidimensional data mining (2001)
Agma Traina, Caetano Traina, Spiros Papadimitriou, Christos Faloutsos
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answer the following...
The connectivity and fault-tolerance of the Internet topology (2001)
Christopher R. Palmer, Georgos Siganos, Michalis Faloutsos, Christos Faloutsos
In this paper, we apply data mining analysis to study the topology of the Internet, thus creating a new processing framework. To the best of our knowledge, this is one of the rst studies that focus...
Netcube: A scalable tool for fast data mining and compression (2001)
Dimitris Margaritis, Christos Faloutsos, Sebastian Thrun
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute values and “don’t...
FALCON: Feedback Adaptive Loop for Content-Based Retrieval (2000)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry R.
Several methods currently exist that can perform relatively simple queries driven by relevance feedback on large multimedia databases. However, all these methods work only for vector spaces; that is,...
Fast Feature Selection Using Fractal Dimension (2000)
Caetano Traina, Leejay Wu, Christos Faloutsos
Dimensionality curse and dimensionality reduction are two issues that have retained high interest for data mining, machine learning, multimedia indexing, and clustering. We present a fast, scalable...
FALCON: Feedback Adaptive Loop for Content-Based Retrieval (2000)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry R.
Several methods currently exist that can perform relatively simple queries driven by relevance feedback on large multimedia databases. However, all these methods work only for vector spaces; that is,...
FALCON: Feedback Adaptive Loop for Content-Based Retrieval (2000)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry R.
Several methods currently exist that can perform relatively simple queries driven by relevance feedback on large multimedia databases. However, all these methods work only for vector spaces; that is,...
Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes (2000)
Caetano Traina, Agma Traina, Bernhard Seeger, Christos Faloutsos
Abstract. In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the “fat-factor ” which provides a simple way to...
Spatial Join Selectivity (2000)
Using Power Laws, Christos Faloutsos, Bernhard Seeger, Agma Traina
Additional funding was provided by donations from NEC and Intel. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not...
Deflating the Dimensionality Curse using Multiple Fractal Dimensions (2000)
Bernd-Uwe Pagel, Flip Korn, Sap Ag, Christos Faloutsos
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previous analyses have...
Density Biased Sampling: An Improved Method for Data Mining and Clustering (2000)
Christopher R. Palmer, Christos Faloutsos
Data mining in large data sets often requires a sampling or summarization step to form an in-core representation of the data that can be processed more efficiently. Uniform random sampling is...
Fast Time Sequence Indexing for Arbitrary L p Norms (2000)
Byoung-kee Yi, Christos Faloutsos
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean distance and its...
FALCON: Feedback Adaptive Loop for Content-Based Retrieval (2000)
Leejay Wu Christos, Christos Faloutsos, Katia Sycara, Terry R. Payne
Several methods currently exist that can perform relatively simple queries driven by relevance feedback on large multimedia databases. However, all these methods work only for vector spaces; that is,...
Online Data Mining for Co-Evolving Time Sequences (2000)
Byoung-kee Yi, N. D. Sidiropoulos, Theodore Johnson, H. V. Jagadish, Christos Faloutsos, Alexandros Biliris
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data. We develop a fast method to analyze such...
Online Data Mining for Co-Evolving Time Sequences (2000)
Byoung-kee Yi, N. D. Sidiropoulos, Theodore Johnson, H. V. Jagadish, Christos Faloutsos, ...
In many applications, the data of interest comprises multiple sequences that evolve over time. Examples include currency exchange rates, network traffic data. We develop a fast method to analyze such...
Spatial Join Selectivity Using Power Laws (2000)
Christos Faloutsos, Bernhard Seeger, Agma Traina, Caetano Traina
We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is "find the libraries that are within 10 miles of...
Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes (2000)
Caetano Traina, Agma Traina, Bernhard Seeger, Christos Faloutsos
. In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple way to quantify...
Data mining on an OLTP system (nearly) for free (2000)
Erik Riedel, Christos Faloutsos, Greg Ganger, David Nagle
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that such a scheme makes...
Slim-trees: High performance metric trees minimizing overlap between nodes (2000)
Caetano Traina, Agma Traina, Bernhard Seeger, Christos Faloutsos
. This material is based upon work supported by the National Science Foundation under Grants No. IRI-9625428, DMS-9873442, IIS-9817496, and IIS-9910606, and by the Defense Advanced Research Projects...
Active Disk Architecture for Databases (2000)
Erik Riedel, Christos Faloutsos, David Nagle
Today’s commodity disk drives, the basic unit of storage for computer systems large and small, are actually small computers, with a processor, memory and a network connection, in addition to the...
Active Disk Architecture for Databases (2000)
Erik Riedel, Christos Faloutsos, David Nagle
Today’s commodity disk drives, the basic unit of storage for computer systems large and small, are actually small computers, with a processor, memory and a network connection, in addition to the...
Data mining on an OLTP system (nearly) for free (2000)
Erik Riedel, Christos Faloutsos, Gregory R. Ganger, David F. Nagle
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that such a scheme makes...
Spatial Join Selectivity Using (2000)
Power Laws, Christos Faloutsos, Bernhard Seeger, Agma Traina, Caetano Traina
Foundation under Grants No. IRI-9625428, DMS-9873442, IIS-9817496, and IIS-9910606,
Spatial Join Selectivity Using (2000)
Power Laws, Christos Faloutsos, Bernhard Seeger, Agma Traina, Caetano Traina
Foundation under Grants No. IRI-9625428, DMS-9873442, IIS-9817496, and IIS-9910606,
Alan L. Montgomery, Christos Faloutsos
Violino of Media Metrix have been instrumental to providing access. The work of Christos Faloutsos was
William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, H. V. Jagadish, ...
The Bulletin of the Technical Committee on Data Engineering is published quarterly and is distributed to all TC members. Its scope includes the design, implementation, modelling, theory and...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
Part 1: Main Summary 3 1 Introduction The field of automated learning and discovery--often called data mining, machine learning, oradvanced data analysis--is currently undergoing a revolution. The...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
Informed prefetching of collective input/output requests (1999)
Tara M. Madhyastha, Garth A. Gibson, Christos Faloutsos
Optimizing collective input/output (I/O) is important for improving throughput of parallel scientific applications. Current research suggests that a specialized collective application programming...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
The field of automated learning and discovery---often called data mining, machine learning, or advanced data analysis---is currently undergoing a major change. The progressing computerization of...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
On Power-Law Relationships of the Internet Topology (1999)
Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos
Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November...
Informed Prefetching of Collective Input/Output Requests (1999)
Tara M. Madhyastha, Garth A. Gibson, Christos Faloutsos
Optimizing collective input/output (I/O) is important for improving throughput of parallel scientific applications. Current research suggests that a specialized collective application programming...
Density Biased Sampling: An Improved Method for Data Mining and Clustering (1999)
Christopher R. Palmer, Christos Faloutsos
Data mining in large data sets often requires a sampling or summarization step to form an in-core representation of the data that can be processed more e#ciently. Uniform random sampling is...
Density Biased Sampling: An Improved Method for Data Mining and Clustering (1999)
Christopher R. Palmer, Christos Faloutsos
Data mining in large data sets often requires a sampling or summarization step to form an in-core representation of the data that can be processed more efficiently. Uniform random sampling is...
Data Mining on an OLTP System (Nearly) for Free (1999)
Erik Riedel, Christos Faloutsos, Greg Ganger, David Nagle
This paper proposes a scheme for scheduling disk requests that takes advantage of the ability of high-level functions to operate directly at individual disk drives. We show that such a scheme makes...
December Vol, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, H. V. Jagadish, ...
this paper we describe and evaluate several popular techniques for data reduction. Historically, the primary need for data reduction has been internal to a database system, in a cost-based query...
I/O Complexity for Range Queries on Region Data Stored Using an R-tree (1999)
Guido Proietti, Christos Faloutsos
In this paper we study the node distribution of an R-tree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are packed in minimum...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
On Quality of Service Management (1999)
document are those of the authors and should not be interpreted as representing official policies,
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
Accurate Modeling of Region Data (1998)
Proietti, Guido, Faloutsos, Christos
Spatial data appear in numerous applications, such as GIS multimedia and even traditional databases. Most of the analysis has focused on point data, typically using the uniformity assumption, or,...
Selectivity Estimation of Window Queries for Line Segment Datasets (1998)
Proietti, Guido, Faloutsos, Christos
Despite of the fact that large line segment datasets are becoming more and more popular, most of the analysis for estimating the selectivity of window queries posed on spatial data - the most...
Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees (1998)
Traina, Agma J., Faloutsos, Christos
We discuss the problem of selectivity estimation for range queries in real metric datasets, which include spatial, or dimensional, datasets as a special case. The main contribution of this paper is...
Density Biased Sampling: An Improved Method for Data Mining and Clustering (1998)
Palmer, Christopher R., Faloutsos, Christos
Data mining in large data sets often requires a sampling or summarization step to form an in-core representation of the data that can be processed more efficiently. Uniform random sampling is...
Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes (1998)
Traina, Agma, Seeger, Bernhard, Faloutsos, Christos
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple way to quantify the degree of...
Spatial Join Selectivity Using Power Laws (1998)
Faloutsos, Christos, Seeger, Bernhard, Traina, Agma
We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is "find the libraries that are within 10 miles of schools". Our law...
FALCON: Feedback Adaptive Loop for Content-Based Retrieval (1998)
Wu, Leejay, Faloutsos, Christos, Sycara, Katia, Payne, Terry R.
Several methods currently exist that can perform relatively simple queries driven by relevance feedback on large multimedia, databases. However, all these methods work only for vector spaces; that...
Active Disk Architecture for Databases (1998)
Riedel, Erik, Faloutsos, Christos, Nagle, David
Today's commodity disk drives, the basic unit of storage for computer systems large and small, are actually small computers, with a processor, memory and a network connection, in addition to the...
Fast and effective retrieval of medical tumor shapes (1998)
Philip (flip Korn, Nicholas Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
Abstract—We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (“Find tumors that are similar to a given pattern.”). We...
Informedia: Lessons from a Terabyte+, Operational, Digital Video Database System (1998)
Chris Lichti, Christos Faloutsos, Howard Wactlar, Michael Christel, Alex Hauptmann
We describe the design decisions and lessons learned from Informedia, a digital video database system developed at Carnegie Mellon University and currently hosting over one terabyte of video data....
Overlay Striping and Optimal Parallel I/O for Modern Applications (1998)
Peter Triantafillou, Christos Faloutsos
Disk array systems are rapidly becoming the secondary-storage media of choice for many emerging applications with large storage and high bandwidth requirements. Striping data across the disks of a...
Selectivity Estimation of Window Queries for Line Segment Datasets (1998)
Guido Proietti, Christos Faloutsos
Despite of the fact that large line segment datasets are appearing more and more frequently in numerous applications involving spatial data, such as GIS [8, 9] multimedia [6] and even traditional...
MindReader: Querying databases through multiple examples (1998)
Yoshiharu Ishikawa, Ravishankar Subramanya, Christos Faloutsos
Users often can not easily express their queries. For example, in a multimedia/image by content setting, the user might want photographs with sunsets; in current systems, like QBIC, the user has to...
Sebastian Thrun, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
MindReader: Querying databases through multiple examples (1998)
Yoshiharu Ishikawa, Ravishankar Subramanya, Christos Faloutsos
Users often can not easily express their queries. For example, in a multimedia/image by content setting, the user might want photographs with sunsets; in current systems, like QBIC, the user has to...
MindReader: Querying databases through multiple examples (1998)
Yoshiharu Ishikawa, Ravishankar Subramanya, And Christos Faloutsos, Christos Faloutsos
Users often can not easily express their queries. For example, in a multimedia/image by content setting, the user might want photographs with sunsets; in current systems, like QBIC, the user has to...
Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining (1998)
Flip Korn, Alexandros Labrinidis, Ros Labrinidis, Yannis Kotidis, Christos Faloutsos
Association Rule Mining algorithms operate on a data matrix (e.g., customers \Theta products) to derive association rules [2, 23]. We propose a new paradigm, namely, Ratio Rules, which are...
Sebastian Thrun Christos, Christos Faloutsos, Tom Mitchell, Larry Wasserman
This report summarizes the CONALD meeting, which took place June 11-13, 1998, at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists, concerned with decision...
Active Storage for Large-Scale Data Mining and Multimedia Applications (1998)
Erik Riedel, Garth Gibson, Christos Faloutsos
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using this trend toward...
Accurate Modeling of Region Data (1998)
Guido Proietti, Christos Faloutsos
Spatial data appear in numerous applications, such as GIS [8, 9, 18], multimedia [6] and even traditional databases. Most of the analysis has focused on point data, typically using the uniformity...
MindReader: Querying databases through multiple examples (1998)
Yoshiharu Ishikawa, Ravishankar Subramanya, Christos Faloutsos
Users often can not easily express their queries. For example, in a multimedia/image by content setting, the user might want photographs with sunsets; in current systems, like QBIC, the user has to...
Active Storage for Large-Scale Data Mining and Multimedia (1998)
Erik Riedel, Garth Gibson, Christos Faloutsos
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using this trend toward...
Selectivity Estimation of Window Queries for Line Segment Datasets (1998)
Guido Proietti, Christos Faloutsos
Despite of the fact that large line segment datasets are becoming more and more popular, most of the analysis for estimating the selectivity of window queries posed on spatial data --the most...
Erik Riedel, Garth Gibson, Christos Faloutsos
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using this trend toward...
Design Issues For High Performance Engineering Information Systems. (1997)
Roussopoulos, Nick, Sellis, Timos, Mark, Leo, Faloutsos, Christos
It is increasingly being recognized that an Engineering Information System will be the fundamental component of any design and manufacturing system in the future and that all components in such a...
Designing Access Methods for Bitemporal Databases (1997)
Kumar, Anil, Tsotras, Vassilis J., Faloutsos, Christos
By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper we examine the issues involved in designing...
Designing Access Methods for Bitemporal Databases (1997)
Kumar, Anil, Tsotras, Vassilis J., Faloutsos, Christos
By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper we examine the issues involved in designing...
Quantifiable Data Mining Using Principal Component Analysis (1997)
Korn, Flip, Labrinidis, Alexandros, Kotidis, Yannis, Faloutsos, Christos, Kaplunovich, Alex, Perkovic, Dejan
Association Rule Mining algorithms operate on a data matrix (e.g., customers x products) to derive rules. We propose a single-pass algorithm for mining linear rules in such a matrix based on...
Quantifiable Data Mining Using Principal Component Analysis (1997)
Korn, Flip, Labrinidis, Alexandros, Kotidis, Yannis, Faloutsos, Christos, Kaplunovich, Alex, Perkovic, Dejan
Association Rule Mining algorithms operate on a data matrix (e.g., customers x products) to derive rules. We propose a single-pass algorithm for mining linear rules in such a matrix based on...
Recovering Information from Summary Data (1997)
Faloutsos, Christos, Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Recovering Information from Summary Data (1997)
Faloutsos, Christos, Jagadish, H.V., Sidiropoulos, N.D.
Data is often stored in summarized form, as a histogram of aggregates (COUNTs,SUMs, or AVeraGes) over specified ranges. Queries regarding specific values, or ranges different from those stored,...
Quantifiable Data Mining Using Principal Component Analysis (1997)
Faloutsos, Christos, Korn, Flip, Labrinidis, Alexandros, Kotidis, Yannis, Kaplunovich, Alex, Perkovic, Dejan
Association Rule Mining algorithms operate on a data matrix (e.g., customers x products) to derive rules [2,23]. We propose a single-pass algorithm for mining linear rules in such a matrix based on...
Efficient Retrieval of Similar Time Sequences Under Time Warping (1997)
Yi, B., Jagadish, H.V., Faloutsos, Christos
Fast similarity searching in large time-sequence databases has attracted a lot of research interest. All of them use the Euclidean distance ($L_2$), or some variation of $L_p$ metric. $L_p$ metrics...
Vikrant Kobla, David Doermann, Christos Faloutsos
Development of various multimedia applications hinges on the availability of fast and efficient storage, browsing, indexing, and retrieval techniques. Given that video is typically stored efficiently...
Quantifiable Data Mining Using Principal Component Analysis (1997)
Flip Korn, Ros Labrinidis, Yannis Kotidis, Christos Faloutsos, Alex Kaplunovich
Association Rule Mining algorithms operate on a data matrix (e.g., customers \Theta products) to derive rules [2, 22]. We propose a single-pass algorithm for mining linear rules in such a matrix...
Videotrails: Representing and visualizing structure in video sequences (1997)
Vikrant Kobla, David Doermann, Christos Faloutsos
The problem of determining the physical and semantic structure of an extended video sequence is essential for providing appropriate processing, indexing and retrieval capabilities for video...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyperectangles (1997)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos, Ieee Computer Society
Abstract—We give a closed-form expression for the average number of n-dimensional quadtree nodes (“pieces ” or “blocks”) required by an n-dimensional hyperrectangle aligned with the axes....
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences (1997)
Flip Korn, H. V. Jagadish, Christos Faloutsos
Ad hoc querying is difficult on very large datasets, since it is usually not possible to have the entire dataset on disk. While compression can be used to decrease the size of the dataset, compressed...
Multi-media Indexing Over the Web (1997)
Brent Agnew Dept, Brent Agnew, Christos Faloutsos, Zhengyu Wang, Don Welch, Xiaogang Xue
There has been work on database systems that can retrieve multimedia objects by their content. We are extending this work by using the World Wide Web as source and storage for multimedia objects much...
Representing And, Vikrant Kobla, David Doermann, Christos Faloutsos
The problem of determining the physical and semantic structure of an extended video sequence is essential for providing appropriate processing, indexing and retrieval capabilities for video...
Recovering Information from Summary Data (1997)
Christos Faloutsos Dept, Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
Recovering Information from Summary Data (1997)
Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences (1997)
Flip Korn, H. V. Jagadish, Christos Faloutsos
Ad hoc querying is difficult on very large datasets, since it is usually not possible to have the entire dataset on disk. While compression can be used to decrease the size of the dataset, compressed...
Vikrant Kobla David, David Doermann, Christos Faloutsos
Development of various multimedia applications hinges on the availability of fast and efficient storage, browsing, indexing, and retrieval techniques. Given that video is typically stored efficiently...
Efficient Retrieval of Similar Time Sequences Under Time Warping (1997)
Byoung-kee Yi, H. V. Jagadish, Christos Faloutsos
Fast similarity searching in large time-sequence databases has attracted a lot of research interest [1, 5, 2, 6, 3, 10]. All of them use the Euclidean distance (L 2 ), or some variation of L p...
The New Jersey Data Reduction Report (1997)
Daniel Barbar'a, William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, ...
this paper we describe and evaluate several popular techniques for data reduction. Historically, the primary need for data reduction has been internal to a database system, in a cost-based query...
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyper-rectangles (1997)
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos
We give a closed-form expression for the average number of n-dimensional quadtree nodes (`pieces' or `blocks') required by an n-dimensional hyper-rectangle aligned with the axes. Our...
Recovering Information from Summary Data (1997)
Christos Faloutsos, H. V. Jagadish, N. D. Sidiropoulos
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over specified ranges. We study how to estimate the original detail data from the stored summary. We...
Multi-media Indexing Over the Web (1997)
Brent Agnew, Christos Faloutsos, Zhengyu Wang, Don Welch, Xiaogang Xue
There has been work on database systems that can retrieve multimedia objects by their content. We are extending this work by using the World Wide Web as source and storage for multimedia objects much...
Active Disks - Remote Execution for Network-Attached Storage (1997)
Erik Riedel, Christos Faloutsos, Garth Gibson, Pradeep Khosla, Gerda Riedel, Gertrud Riedel, ...
generous contributions from the member companies of the Parallel Data Consortium: Hewlett-Packard Laboratories,
• problem #1: text- LSI: find ‘concepts’ (1997)
Christos Faloutsos, Flip Korn, H. V. Jagadish, Christos Faloutsos “efficiently, A. Labrinidis, C. Faloutsos, ...
www.cs.cmu.edu/~christos/PUBLICATIONS.OLDER/sigmod97.ps.gz
C.: The New Jersey Data Reduction Report (1997)
Daniel Barbara, William Dumouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis Ioannidis, ...
There is often a need to get quick approximate answers from large databases. This leads to a need for data reduction. There are many di erent approaches to this problem, some of them not...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Moon, Bongki, Jagadish, H.V., Faloutsos, Christos, Saltz, Joel
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporal databases, image compression and so on. In all these...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Korn, Flip, Sidiropoulos, Nikolaos, Faloutsos, Christos, Siegel, Eliot, Protopapas, Zenon
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called `max morpholog- ical distance'), we showed how to lower-bound it and how to search...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Moon, Bongki, Jagadish, H.V., Faloutsos, Christos, Saltz, Joel
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporal databases, image compression and so on. In all these...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Korn, Flip, Sidiropoulos, Nikolaos, Faloutsos, Christos, Siegel, Eliot, Protopapas, Zenon
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called `max morpholog- ical distance'), we showed how to lower-bound it and how to search...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Korn, Flip, Sidiropoulos, N., Faloutsos, Christos
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called ax morphological distance'), we showed how to lower-bound it and how to search...
Modeling Skewed Distribution Using Multifractals and the `80-20' Law (1996)
Christos Faloutsos, Yossi Matias, Avi Silberschatz
law'
Feature normalization for video indexing and retrieval (1996)
Vikrant Kobla, David S. Doermann, Christos Faloutsos
Fast and efficient storage, browing, indexing, and retrieval of video is necessary for the development of various multimedia database applications. Given that video is typically stored efficiently in...
A Survey of Information Retrieval and Filtering Methods (1996)
Christos Faloutsos, Douglas Oard
We survey the major techniques for information retrieval. In the first part, we provide an overview of the traditional ones (full text scanning, inversion, signature files and clustering). In the...
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve (1996)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
Several schemes for linear mapping of a multidimensional space have been proposed for various applications such as access methods for spatio-temporal databases and image compression. In these...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called `max morphological distance'), we show how to lower-bound it and how to search...
Modeling Skewed Distributions Using Multifractals and the `80-20 Law' (1996)
Christos Faloutsos, Yossi Matias, Avi Silberschatz
The focus of this paper is on the characterization of the skewness of an attributevalue distribution and on the extrapolations for interesting parameters. More specifically, given a vector with the...
Modeling Skewed Distributions Using Multifractals and the `80-20 Law' (1996)
Christos Faloutsos Dept, Christos Faloutsos, Yossi Matias, Avi Silberschatz
The focus of this paper is on the characterization of the skewness of an attributevalue distribution and on the extrapolations for interesting parameters. More specifically, given a vector with the...
Modeling Skewed Distributions Using Multifractals and the `80-20 Law' (1996)
Christos Faloutsos, Yossi Matias, Avi Silberschatz
PAPER NO. 1077 The focus of this paper is on the characterization of the skewness of an attribute-value distribution and on the extrapolations for interesting parameters. More specifically, given a...
Analysis of n-dimensional Quadtrees Using the Hausdorff Fractal Dimension (1996)
Christos Faloutsos, Volker Gaede
There is mounting evidence [Man77, Sch91] that real datasets are statistically self-similar, and thus, `fractal'. This is an important insight since it permits a compact statistical description...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called `max morphological distance'), we showed how to lower-bound it and how to...
Declustering Spatial Databases on a Multi-Computer Architecture (1996)
Nikos Koudas, Christos Faloutsos, Ibrahim Kamel
. We present a technique to decluster a spatial access method on a shared-nothing multi-computer architecture [DGS + 90]. We propose a software architecture with the R-tree as the underlying spatial...
Fast Nearest Neighbor Search in Medical Image Databases (1996)
Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
We examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called `max morphological distance'), we showed how to lower-bound it and how to...
Fast and Effective Similarity Search in Medical Tumor Databases Using Morphology (1996)
Flip Korn, Nikolaos Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
We examine the problem of finding similar tumor shapes. The main contribution of this work is the proposal of a natural (dis-)similarity function for shape matching called the `morphological...
A Survey of Information Retrieval and Filtering Methods (1996)
Christos Faloutsos, Douglas W. Oard
We survey the major techniques for information retrieval. In the first part, we provide an overview of the traditional ones (full text scanning, inversion, signature files and clustering). In the...
Analysis of the Clustering Properties of Hilbert Space-filling Curve (1996)
Bongki Moon, H. V. Jagadish, Christos Faloutsos, Joel H. Saltz
Several schemes for linear mapping of multidimensional space have been proposed for many applications such as access methods for spatio-temporaldatabases, image compression and so on. In all these...
Declustering Spatial Databases on a Multi-Computer Architecture (1996)
Nikos Koudas, Christos Faloutsos, Ibrahim Kamel
. We present a technique to decluster a spatial access method on a shared-nothing multi-computer architecture [DGS + 90]. We propose a software architecture with the R-tree as the underlying spatial...
A Survey of Information Retrieval and Filtering Methods (1996)
Christos Faloutsos, Douglas Oard
We survey the major techniques for information retrieval. In the first part, we provide an overview of the traditional ones (full text scanning, inversion, signature files and clustering). In the...
Fast nearest neighbor search in medical image databases (1996)
Flip Korn, Nikolaos Sidirapoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
We examine the problem of finding similar tu-mor shapes. Starting from a natural,similar-ity function (the so-called ‘max morphological distance’), we show how to lower-bound it and how to search...
A Survey of Information Retrieval and Filtering Methods (1995)
Faloutsos, Christos, Oard, Douglas W.
We survey the major techniques for information retrieval. In the first part, we provide an overview of the traditional ones (full text scanning, inversion, signature files and clustering). In the...
A Survey of Information Retrieval and Filtering Methods (1995)
Faloutsos, Christos, Oard, Douglas W.
We survey the major techniques for information retrieval. In the first part, we provide an overview of the traditional ones (full text scanning, inversion, signature files and clustering). In the...
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension (1995)
Belussi, Alberto, Faloutsos, Christos
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier, real point sets: (a) violate consistently the "uniformity" and...
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension (1995)
Belussi, Alberto, Faloutsos, Christos
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier, real point sets: (a) violate consistently the "uniformity" and...
Faloutsos, Christos, Lin, King-Ip (David)
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert rJag91]....
Faloutsos, Christos, Lin, King-Ip (David)
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert rJag91]....
Estimating the Selectivity of Spatial Queries Using the orrelation' Fractal Dimension (1995)
Belussi, Alberto, Faloutsos, Christos
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier [FK94a], real point sets: (a) violate consistently the ﲵniformity'...
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]....
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension (1995)
Alberto Belussi, Christos Faloutsos
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier [FK94a], real point sets: (a) violate consistently the...
Christos Faloutsos, King-Ip (David) Lin
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [25]....
Similarity Searching in Large Image DataBases (1995)
Euripides Petrakis, Christos Faloutsos
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and...
Flexible and Adaptable Buffer Management Techniques for Database Management Systems (1995)
Christos Faloutsos, Raymond Ng, Timos Sellis
The problem of buffer management in database management systems is concerned with the efficient main memory allocation and management for answering database queries. Previous works on buffer...
Christos Faloutsos, King-Ip (David) Lin
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]....
Similarity Searching in Large Image DataBases (1995)
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and...
Experimental Investigation of High Performance Cognitive and Interactive Text Filtering (1995)
Douglas Oard, Nicholas Declaris, Bonnie J. Dorr, Christos Faloutsos
Text filtering has become increasingly important as the volume of networked information has exploded in recent years. This paper reviews recent progress in that field and reports on the development...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Yannis
We give a closed-form expression for the average number of $n$-dimensional quadtree nodes (`pieces' or `blocks') required by an $n$-dimensional hyper-rectangle aligned with the axes. Our formula...
Similarity Searching in Large Image Databases (1994)
Petrakis, Euripides G.M., Faloutsos, Christos
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and...
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Yannis
We give a closed-form expression for the average number of $n$-dimensional quadtree nodes (`pieces' or `blocks') required by an $n$-dimensional hyper-rectangle aligned with the axes. Our formula...
Similarity Searching in Large Image Databases (1994)
Petrakis, Euripides G.M., Faloutsos, Christos
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and...
Faloutsos, Christos, Kamel, Ibrahim
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S....
Faloutsos, Christos, Kamel, Ibrahim
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S....
Experimenting with Pattern Matching Algorithms (1994)
Manolopoulos, Y., Faloutsos, Christos
Two new pattern matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character...
Declustering R-Tree on Multi-Computer Architectures (1994)
Koudas, N., Faloutsos, Christos, Kamel, Ibrahim
We study a method to decluster a spatial access method (and specifically an R-tree) on a shared-nothing multi-computer architecture [9]. Our first step is to propose a software architecture, with the...
The TV-tree -- an Index Structure for High-Dimensional Data (1994)
Lin, K-I., Jagadish, H.V., Faloutsos, Christos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Faloutsos, Christos, Lin, K-P.D.
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]....
Analysis of the n-dimensional quadtree decomposition for arbitrary hyper-rectangles (1994)
Faloutsos, Christos, Jagadish, H.V., Manolopoulos, Y.
We give a closed-form expression for the average number of n- dimensional quadtree nodes (ieces' or locks') required by an n-dimensional hyper-rectangle aligned with the axes. Our formula...
Similarity Searching in Large Image DataBases (1994)
Petrakis, E.G.M., Faloutsos, Christos
We propose a method to handle approximate searching by image content in large image databases. Image content is represented by attributed relational graphs holding features of objects and...
The TV-tree -- an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Christos Faloutsos, Ibrahim Kamel
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S....
Fast Subsequence Matching in Time-Series Databases (1994)
Christos Faloutsos, M Ranganathan, Yannis Manolopoulos
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance....
Hilbert R-tree: An improved R-tree using fractals (1994)
Ibrahim Kamel, Christos Faloutsos
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the...
Bit-Sliced Signature Files for Very Large Text Databases on a Parallel Machine Architecture (1994)
George Panagopoulos, Christos Faloutsos
. Free text retrieval is an important problem which can significantly benefit from a parallel architecture. Signature methods have been proposed to answer text retrieval queries in parallel machines...
Fast Subsequence Matching in Time-Series Databases (1994)
Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance....
On Automatic Filtering of Multilingual Texts (1994)
Douglas W. Oard, Nicholas Declaris, Bonnie J. Dorr, Christos Faloutsos
An emerging requirement to sift through the increasing flood of text information has led to the rapid development of information filtering technology in the past five years. This study introduces...
Hilbert R-tree: An improved R-tree using fractals (1994)
Ibrahim Kamel, Christos Faloutsos
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing an ordering on the...
The TV-tree - an index structure for high-dimensional data (1994)
King-ip Lin, H. V. Jagadish, Christos Faloutsos
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the...
Fast Subsequence Matching in Time-Series Databases (1993)
Faloutsos, Christos, Ranganathan, M., Manolopoulos, Yannis
We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance....
Fast Subsequence Matching in Time-Series Databases (1993)
Faloutsos, Christos, Ranganathan, M., Manolopoulos, Yannis
We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance....
Hilbert R-tree: An improved Rtree using fractals (1993)
Kamel, Ibrahim, Faloutsos, Christos
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to pack rectangles into the Entree nodes according to a linear ordering as opposed to the more complex...
Hilbert R-tree: An improved Rtree using fractals (1993)
Kamel, Ibrahim, Faloutsos, Christos
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to pack rectangles into the Entree nodes according to a linear ordering as opposed to the more complex...
Packed R-trees Using Fractals (1993)
Faloutsos, Christos, Kamel, Ibrahim
We propose a new packing technique for R-trees for static databases. Given a collection of rectangles, we sort them and we build the R-tree bottom-up. There are several ways to sort the rectangles;...
Hilbert R-Tree: An Improved R-Tree Using Fractals (1993)
Kamel, Ibrahim, Faloutsos, Christos
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to impose a linear ordering on the data rectangles. This ordering has to be 'good', in the sense that...
Faloutsos, Christos, Kamel, Ibrahim
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S....
Fast Subsequence Matching in Time-Series Data bases (1993)
Faloutsos, Christos, Ranganathan, M., Manolopoulos, Y.
We present an efficient indexing method to locate subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to...
QVLDB The W-Tree: An Index Structure for High-Dimensional Data (1993)
King-lp Lin, H. V. Jagadish, Christos Faloutsos
Abstract. We propose a file structure to index high-dimensionality data, which are typically points in some feature space. The idea is to use only a few of the fea-tures, using additional features...
Efficient Similarity Search in Sequence Databases (1993)
Rakesh Agrawal, Christos Faloutsos, Arun Swami
Abstract. We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial...
QBISM: A Prototype 3-D Medical Image Database System (1993)
Manish Arya, William Cody, Christos Faloutsos, Joel Richardson, Arthur Toga
this paper. However, these automatic or semi-automatic warping algorithms are extremely important for this application. It is precisely this technology that permits anatomic structure-based access to...
Declustering Using Fractals (1993)
Christos Faloutsos, Pravin Bhagwat
We propose a method to achieve declustering for cartesian product files on M units. The focus is on range queries, as opposed to partial match queries that older declustering methods have examined....
Efficient Similarity Search In Sequence Databases (1993)
Rakesh Agrawal, Christos Faloutsos, Arun Swami
. We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial...
Ibrahim Kamel, Christos Faloutsos
We propose new R-tree packing techniques for static databases. Given a collection of rectangles, we sort them and we build the R-tree bottom-up. There are several ways to sort the rectangles; the...
Efficient Similarity Search In Sequence Databases (1993)
Rakesh Agrawal, Christos Faloutsos, Arun Swami
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation...
Ibrahim Kamel, Christos Faloutsos
We propose new R-tree packing techniques for static databases. Given a collection of rectangles, we sort them and we build the R-tree bottom-up. There are several ways to sort the rectangles; the...
Efficient Similarity Search in Sequence Databases (1993)
Rakesh Agrawal, Christos Faloutsos, Arun Swami
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation...
Packed R-trees Using Fractals (1992)
Faloutsos, Christos, Kamel, Ibrahim
We propose a new packing technique for R-trees for static databases. Given a collection of rectangles, we sort them and we build the Rtree bottom-up. There are several ways to sort the rectangles;...
Packed R-trees Using Fractals (1992)
Faloutsos, Christos, Kamel, Ibrahim
We propose a new packing technique for R-trees for static databases. Given a collection of rectangles, we sort them and we build the Rtree bottom-up. There are several ways to sort the rectangles;...
Kamel, Ibrahim, Faloutsos, Christos
We consider the problem of exploiting parallelism to accelerate the performance of spatial access methods and specifically, R-trees [14]. Our goal is to design a server for spatial data, so that to...
Kamel, Ibrahim, Faloutsos, Christos
We consider the problem of exploiting parallelism to accelerate the performance of spatial access methods and specifically, R-trees [14]. Our goal is to design a server for spatial data, so that to...
Diamond-Tree: An Index Structure for High-Dimensionality Approximate Searching (1992)
Faloutsos, Christos, Jagadish, H.V.
A selection query applied to a database often has the selection predicate imperfectly specified. We present a technique, called the Diamond-tree, for indexing fields to perform similarity-based...
On B-tree Indices for Skewed Distributions (1992)
Christos Faloutsos, H. V. Jagadish
It is often the case that the set of values over which a B-Tree is constructed has a skewed distribution. We present a geometric growth technique to manage postings records in such cases, and show...
Ibrahim Kamel, Christos Faloutsos
We consider the problem of exploiting parallelism to accelerate the performance of spatial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to...
Ibrahim Kamel, Christos Faloutsos
We consider the problem of exploiting parallelism to accelerate the performance of spatial access methods and specifically, R-trees [11]. Our goal is to design a server for spatial data, so that to...
DOT: A Spatial Access Method Using Fractals (1991)
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine access methods for these...
Predictive load control for flexible buffer allocation (1991)
Christos Faloutsos, R. Aymond Ng, Timos Sellis
Existfen buffer allocat,ion ~nrt.lmrls IISC \ prcca.lculnt,ed para.met,ers t,o nlake I>ufT~r allocation decisions. The main idpa proposed here is to design an ndnp!nhlc hufi’er alloca.lion...
Christos Faloutsos, Raymond Lee, Catherine Plaisant, Ben Shneiderman
Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string search is an effective complement to...
Faloutsos, Christos, Lee, Raymond, Plaisant, Catherine, Shneiderman, Ben
Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string search is an effective complement to...
Faloutsos, Christos, Lee, Raymond, Plaisant, Catherine, Shneiderman, Ben
Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string search is an effective complement to...
Fractals for Secondary Key Retrieval (1989)
Faloutsos, Christos, Roseman, Shari
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secondary-key- and...
Fractals for Secondary Key Retrieval (1989)
Faloutsos, Christos, Roseman, Shari
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secondary-key- and...
Fractals for Secondary Key Retrieval (1989)
Christos Faloutsos Shari, Christos Faloutsos, Shari Roseman
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secondary-key- and...
Fractals for Secondary Key Retrieval (1989)
Christos Faloutsos, Shari Roseman
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secondary-key- and...
Christos Faloutsos, Raphael Chan
High capacity disks, especially optical ones, are commercially available. These disks are ideal for archiving large text data bases. In this work, we examine efficient searching techniques for such...
Analysis of Object Oriented Spatial Access Methods. (1987)
Faloutsos, Christos, Sellis, T., Roussopoulos, N.
This paper provides an analysis of R-trees and a variation (R+ - trees) that avoids overlapping rectangles in intermediate nodes of the tree. The main contributions of the paper are the following....
The R+ -Tree: A Dynamic Index for Multi-Dimensional Objects. (1987)
Sellis, T., Roussopoulos, N., Faloutsos, Christos
The problem of indexing multidimensional objects is considered. First, a classification of existing methods in given along with a discussion of the major issues involved in multidimensional data...
PSQL: An Efficient Pictorial Database System. (1987)
Roussopoulos, N., Faloutsos, Christos, Sellis, T.
Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the...
Expert Database Systems: Efficient Support for Engineering Environments. (1987)
Sellis, T., Roussopoulos, N., Mark, L., Faloutsos, Christos
Manufacturing and Engineering processes use both large scale data and knowledge bases, and the use of expert systems in such environments has become a necessity. Expert Database Systems have evolved...
High Performance Engineering Information Systems. (1987)
Roussopoulos, N., Mark, L., Sellis, T., Faloutsos, Christos
We present a framework for developing High Performance Engineering Information Systems (EIS) based on Incremental Computation Models. These models utilize results of previous computations stored in...
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects (1987)
Nick Roussopoulos, Christos Faloutsos
The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data...
The R+-Tree: A Dynamic Index For Multi-Dimensional Objects (1987)
Timos Sellis, Nick Roussopoulos, Christos Faloutsos
The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data...
The R + -tree: A dynamic index for multidimensional objects (1987)
Timos Sellis, Nick Roussopoulos, Christos Faloutsos
The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data...
The R + -tree: A dynamic index for multidimensional objects (1987)
Timos Sellis, Nick Roussopoulos, Christos Faloutsos
The problem of indexing multidimensional objects is considered. First, a classification of existing methods is given along with a discussion of the major issues involved in multidimensional data...
Christos Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, C. Faloutsos, ...
e.g., person.car_id=car.id • Goal: Maximize performance – Some methods require additional indexing, or are only useful on indexed fields
Protein complex identification by supervised graph local clustering
Qi, Yanjun, Balem, Fernanda, Faloutsos, Christos, Klein-Seetharaman, Judith, Bar-Joseph, Ziv
Motivation: Protein complexes integrate multiple gene products to coordinate many biological functions. Given a graph representing pairwise protein interaction data one can search for subgraphs...