A Comparative Evaluation of Anomaly Detection Techniques for Sequence Data (2009)
Varun Ch, Varun Mithal, Vipin Kumar
Anomaly detection has traditionally dealt with record or transaction type data sets. But in many real domains, data naturally occurs as sequences, and therefore the desire of studying anomaly...
Chapter 2 INTRUSION DETECTION: A SURVEY (2009)
Ar Lazarevic, Vipin Kumar, Jaideep Srivastava
This chapter provides the overview of the state of the art in intrusion detection research. Intrusion detection systems are software and/or hardware components that monitor computer systems and...
Similarity Measures for Categorical Data: A Comparative Evaluation Abstract (2009)
Shyam Boriah, Varun Chandola, Vipin Kumar
Measuring similarity or distance between two entities is a key step for several data mining and knowledge discovery tasks. The notion of similarity for continuous data is relatively well-understood,...
Incorporating functional inter-relationships into protein function prediction algorithms (2009)
Pandey, Gaurav, Myers, Chad L, Kumar, Vipin
Abstract Background Functional classification schemes (e.g. the Gene Ontology) that serve as the basis for annotation efforts in several organisms are often the source of gold standard information...
Chapter 3 The MINDS- Minnesota Intrusion Detection System (2009)
Levent Ertöz, Eric Eilertson, Ar Lazarevic, Pang-ning Tan, Vipin Kumar, Jaideep Srivastava
a suite of data mining techniques to automatically detect attacks against computer networks and systems. While the long-term objective of MINDS is to address all aspects of intrusion detection, in...
Ar Lazarevic, Paul Dokas, Levent Ertoz, Vipin Kumar, Jaideep Srivastava, Pang-ning Tan
The information technology advances that provide new capabilities to our forces also provide the enemy with new and powerful tools to launch attacks on our critical information resources. A specific...
TAPER: A two-step approach for all-strong-pairs correlation query in large databases (2008)
Hui Xiong, Shashi Shekhar, Pang-ning Tan, Vipin Kumar
Abstract—Given a user-specified minimum correlation threshold and a market-basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Estimating False Negatives for Classification Problems with Cluster Structure (2008)
György J. Simon, Vipin Kumar, Zhi-li Zhang
Estimating the number of false negatives for a classifier when the true outcome of the classification is ascertained only for a limited number of instances is an important problem, with a wide range...
Abstract A Comparison of Document Clustering Techniques (2008)
Michael Steinbach, George Karypis, Vipin Kumar
This paper presents the results of an experimental study of some common document clustering techniques. In particular, we compare the two main approaches to document clustering, agglomerative...
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering (2008)
Ar Lazarevic, Ramdev Kanapady, Rika Kamath, Vipin Kumar, Kumar Tamma
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarchical clustering...
Computational Approaches for Protein Function Prediction: A Survey (2008)
Gaurav P, Vipin Kumar, Michael Steinbach
Proteins are the most essential and versatile macromolecules of life, and the knowledge of their functions is a crucial link in the development of new drugs, better crops, and even the development of...
Efficient Algorithms for Creating Product Catalogs * (2008)
Michael Steinbach, George Karypis, Vipin Kumar
For the purposes of this paper we define a catalog to be a promotional catalog, i.e., a collection of products (items) presented to a customer with the hope of encouraging a purchase. The single...
Abstract A New Shared Nearest Neighbor Clustering Algorithm and its Applications (2008)
Levent Ertöz, Michael Steinbach, Vipin Kumar
Clustering depends critically on density and distance (similarity), but these concepts become increasingly more difficult to define as dimensionality increases. In this paper we offer definitions of...
DDDAS/ITR: A Data Mining and Exploration Middleware for Grid and Distributed Computing (2008)
Jon B. Weissman, Vipin Kumar, Varun Ch, Eric Eilertson, Levent Ertoz, Gyorgy Simon, ...
Abstract. We describe our project that marries data mining together with Grid computing. Specifically, we focus on one data mining application- the Minnesota Intrusion Detection System (MINDS), which...
Estimating False Negatives for Classification Problems with Cluster Structure (2008)
György J. Simon, Vipin Kumar, Zhi-li Zhang
Estimating the number of false negatives for a classifier when the true outcome of the classification is ascertained only for a limited number of instances is an important problem, with a wide range...
Computational Approaches for Protein Function Prediction (2008)
Gaurav P, Michael Steinbach, Rohit Gupta, Tushar Garg, N. Ramakrishnan, Vipin Kumar
•The knowledge of protein function is a crucial link in the development of new drugs, better crops, and synthetic biochemicals such as biofuels •With the rapid advances in sequencing technology,...
Hui Xiong, Shashi Shekhar, Pang-ning Tan, Vipin Kumar
Given a user-specified minimum correlation threshold ¢ and a transaction database with £ items, all-strongpairs correlation query finds all item pairs with correlations above the threshold ¢....
Submission to: Global and Planetary Change (2008)
Christopher Potter, Steven Klooster, Ranga Myneni, Vanessa Genovese, Pang-ning Tan, Vipin Kumar
Abstract. A simulation model based on satellite observations of monthly vegetation cover was used to estimate monthly carbon fluxes in terrestrial ecosystems from 1982 to 1998. The NASA-CASA model...
Estimating False Negatives for Classification Problems with Cluster Structure (2008)
György J. Simon, Vipin Kumar, Zhi-li Zhang
Estimating the number of false negatives for a classifier when the true outcome of the classification is ascertained only for a limited number of instances is an important problem, with a wide range...
Estimating false negatives for classification problems with cluster structure (2008)
György J. Simon, Vipin Kumar, Zhi-Li Zhang
Estimating the number of false negatives for a classifier when the true outcome of the classification is ascertained only for a limited number of instances is an important problem, with a wide range...
Eui-hong Han, George Karypis, Vipin Kumar, Bamshad Mobasher, Mining Charu, C. Aggarwal, ...
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...
Problem Characterization • Temporal (2008)
Benjamin Mayer, Huzefa Rangwala, Rohit Gupta, Jaideep Srivastava, George Karypis, Vipin Kumar, ...
a classification model to predict liver fibrosis stage based on combinations of common laboratory tests, obtained over time during routine patient care • Find unknown novel patterns in a large...
Abstract. In this paper, we formulate the problem of summarization of a dataset of transactions with categorical attributes as an optimization problem involving two objective functions- compaction...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification ∗ (2008)
Categorization of documents is challenging, as the number of discriminating words can be very large. We present a nearest neighbor classification scheme for text categorization in which the...
ARTICLE NO. PC971410 Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes 1 (2008)
Kirk Schloegel, George Karypis, Vipin Kumar
For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be...
Articles Algorithms for Constraint- Satisfaction Problems: A (2008)
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance,...
Privacy Preserving Nearest Neighbor Search (2008)
Mark Shaneck, Yongdae Kim, Vipin Kumar
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA)...
Michael Steinbach, Vipin Kumar
Abstract. In this paper, we explore extending association analysis to non-traditional types of patterns and non-binary data by generalizing the notion of confidence. We begin by describing a general...
Aleksandar Lazarević, Jaideep Srivastava, Vipin Kumar
PAKDD-2004 Tutorial � We are drowning in the deluge of data that are being collected
Daniel J. Challou, Maria Gini, Vipin Kumar, George Karypis
Abstract. In this paper we discuss methods for predicting the performance of any formulation of randomized parallel search, and propose a new performance prediction method that is based on obtaining...
Kirk Schloegel, George Karypis, Vipin Kumar
Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the...
Vipin Kumar, Chris Potter, Michael Steinbach, Shyam Boriah, Steve Klooster, Pang-ning Tan, ...
processes
Paper Number: 432 Multilevel Refinement for Hierarchical Clustering ∗ (2008)
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in...
TAPER: A two-step approach for all-strong-pairs correlation query in large databases (2008)
Hui Xiong, Shashi Shekhar, Pang-ning Tan, Vipin Kumar
Given a user-specified minimum correlation threshold θ and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations...
Contemporary Mathematics Objective Measures for Association Pattern Analysis (2008)
Michael Steinbach, Pang-ning Tan, Hui Xiong, Vipin Kumar
Abstract. Data mining is an area of data analysis that has arisen in response to new data analysis challenges, such as those posed by massive data sets or non-traditional types of data. Association...
Articles Algorithms for Constraint- Satisfaction Problems: A (2008)
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance,...
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering, AHPCRC (2008)
Ar Lazarevic, Ramdev Kanapady, Rika Kamath, Vipin Kumar, Kumar Tamma
In this paper, we propose a novel technique for the efficient prediction of multiple continuous target variables from high-dimensional and heterogeneous data sets using a hierarchical clustering...
PSPASES: An E cient and Scalable Parallel Sparse Direct Solver (2008)
Mahesh Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred Gustavson
Many problems in engineering and scienti c domains require solving large sparse systems of linear equations, as a computationally intensive steptowards the nal solution. It has long beenachallenge to...
E cient Parallel Algorithms for Mining Associations? (2008)
Mahesh V. Joshi, George Karypis, Vipin Kumar
Abstract. The problem of mining hidden associations present in the large amounts of data has seen widespread applications in many practical domains such as customer-oriented planning and marketing,...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification ∗ (2008)
Categorization of documents is challenging, as the number of discriminating words can be very large. We present a nearest neighbor classification scheme for text categorization in which the...
William Leinberger, George Karypis, Vipin Kumar, Rupak Biswas
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
TAPER: A Two-Step Approach for All-strong-pairs Correlation Query in Large Databases (2008)
Hui Xiong, Student Member, Shashi Shekhar, Vipin Kumar, Pang-ning Tan
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations above...
Predicting Land Temperature Using Ocean Data (2008)
Shyam Boriah Gyorgy, György Simon, Maniratan Naorem, Michael Steinbach, Vipin Kumar, Steven Klooster, ...
To analyze the e#ect of the oceans and atmosphere on land climate, Earth Scientists have developed climate indices, which are time series that summarize the behavior of selected regions of the...
Will Be Inserted, Hui Xiong, Michael Steinbach, Vipin Kumar
In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensitive information....
Load Balancing for Parallel Optimization Techniques (2008)
this memory requirement becomes prohibitive. Many limitedmemory variants of heuristic search have been developed. These techniques rely on retraction or delayed expansion of less promising nodes to...
Shipra Srivastava, Vijai Singh, Vipin Kumar, Praveen Chandra Verma, Rajeev Srivastava, Vaishali Basu, ...
A bacterial strain, designated AcBz01, was isolated from a water sample collected from Gomti River, Lucknow, India, and identified using a molecular approach. On the basis of the bacterial 16S rRNA...
Top 10 algorithms in data mining (2008)
Wu, Xindong, Kumar, Vipin, Quinlan, J. Ross, Ghosh, Joydeep, Yang, Qiang, Motoda, Hiroshi, ...
Robust and efficient identification of biomarkers by classifying features on graphs (2008)
Hwang, TaeHyun, Sicotte, Hugues, Tian, Ze, Wu, Baolin, Kocher, Jean-Pierre, Wigle, Dennis A., ...
Motivation: A central problem in biomarker discovery from large-scale gene expression or single nucleotide polymorphism (SNP) data is the computational challenge of taking into account the dependence...
WebACE: A Web Agent for Document Categorization and Exploration (2007)
George Karypis, Vipin Kumar, Bamshad Mobasher, Jerome Moore
We propose an agent for exploring and categorizing documents on the World Wide Web. The heart of the agent is an automatic categorization of a set of documents, combined with a process for generating...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification # (2007)
Categorization of documents is challenging, as the number of discriminating words can be very large. We present a nearest neighbor classification scheme for text categorization in which the...
Parallelizing Spatial Databases on Shared-Memory Multiprocessors (2007)
Vipin Kumar, Douglas Chubb, Greg Turner, Shashi Shekhar, Shashi Shekhar, Sivakumar Ravada, ...
Several emerging visualization applications such as flight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-fidelity...
Vipin Kumar, Douglas Chubb, Greg Turner, Shashi Shekhar, Shashi Shekhar, Sivakumar Ravada, ...
Several emerging visualization applications such as flight simulators, distributed interactive simulation (DIS), and virtual reality are using geographic information systems (GISs) for high-fidelity...
Parallel Algorithms for Mining Sequential Associations: Issues and Challenges (2007)
Mahesh V. Joshi, George Karypis, Vipin Kumar
Discovery of predictive sequential associations among events is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly...
Anshul Gupta, Mahesh Joshi, Vipin Kumar
. The Watson Symmetric Sparse Matrix Package, WSSMP, is a high-performance, robust, and easy to use software package for solving large sparse symmetric systems of linear equations. It can be used as...
Text Categorization Using Weight Adjusted (2007)
Nearest Neighbor Classification, Vipin Kumar
Text categorization is the task of deciding whether a document belongs to a set of prespecified classes of documents. Automatic classification schemes can greatly facilitate the process of...
On Architecture Independent Design and Analysis of Parallel Programs (2007)
Ananth Grama, Vipin Kumar, Sanjay Ranka, Vineet Singh
The presence of a universal machine model for serial algorithm design, namely the von Neumann model, has been one of the key ingredients of the success of uniprocessors. The presence of such a model...
Chapter 3 MINDS- Minnesota Intrusion Detection System (2007)
Levent Ertöz, Eric Eilertson, Ar Lazarevic, Pang-ning Tan, Vipin Kumar, Jaideep Srivastava
This paper introduces the Minnesota Intrusion Detection System (MINDS), which uses a suite of data mining techniques to automatically detect attacks against computer networks and systems. While the...
Isoefficiency Function: A Sealability Metric for Parallel Algorithms and Architectures (2007)
Ananth Grama, Anshul Gupta, Vipin Kumar
This paper provides a tutorial introduction to a performance evaluation metric called the isoefficiency function. Traditional methods for evaluating serial algorithms are inadequate for analyzing the...
Spatial Cone Tree: An Index Structure for Correlation-based (2007)
Similarity Queries On, Pusheng Zhang, Shashi Shekhar, Vipin Kumar, Yan Huang
this paper, we develop the spatial cone tree, an index structure for spatial time series data. The spatial cone tree groups similar time series together based on spatial proximity. Correlationbased...
Performance and Scalability of the Parallel Simplex Method for (2007)
Dense Linear Programming, George Karypis, Vipin Kumar
George Karypis and Vipin Kumar Computer Science Department University of Minnesota May 21, 1994 1
Outlier Detection: A Survey (2007)
Varun Ch, Arindam Banerjee, Vipin Kumar, Varun Chandola
Outlier detection is an important problem that has been researched within diverse knowledge disciplines and application domains. Many of these techniques have been specifically developed for certain...
Similarity Measures for Categorical Data—A Comparative Study Abstract (2007)
Varun Ch, Shyam Boriah, Vipin Kumar, Varun Ch, Shyam Boriah, Vipin Kumar
Measuring similarity or distance between two entities is a key step for several data mining and knowledge discovery tasks. The notion of similarity for continuous data is relatively well-understood,...
Gray’s Anatomy: Dissecting Scanning Activities Using IP Gray Space Analysis (2007)
Yu Jin, György Simon, Kuai Xu, Zhi-li Zhang, Vipin Kumar
Abstract — In this paper, we study the scanning activities towards a large campus network using a month-long netflow traffic trace. Based on the novel notion of “gray ” IP space (namely,...
Identifying Clinical and Genetic Markers of Human Disease by Classifying Features on Graphs (2007)
Taehyun Hwang, Hugues Sicotte, Dennis Wigle, Jean-pierre Kocher, Vipin Kumar, Rui Kuang, ...
Abstract. Identification of clinical and genetic markers of disease can provide crucial information for both disease treatment and etiology. This complex task involves associating high-dimensional...
Gaurav Pandey, Tushar Garg, Michael Steinbach, Vipin Kumar, Rohit Gupt
Protein interaction networks are one of the most promising types of biological data for the discovery of functional modules and the prediction of individual protein functions. However, it is known...
Incorporating functional inter-relationships into algorithms for protein function prediction (2007)
A variety of recently available high throughput data sets, such as protein-protein interaction networks, microarray data and genome sequences, offer important insights into the mechanisms leading to...
Incorporating functional inter-relationships into algorithms for protein function prediction (2007)
Gaurav P, Vipin Kumar, Gaurav P, Vipin Kumar
The inter-relationships between functional classes constituting Gene Ontology raise several challenging issues for classification-based function prediction algorithms, such as smaller distinction...
DOI 10.1007/s10115-007-0114-2 SURVEY PAPER Top 10 algorithms in data mining (2007)
Xindong Wu, Vipin Kumar, J. Ross, Quinlan Joydeep, Ghosh Qiang Yang, Hiroshi Motoda, ...
Abstract This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, PageRank,...
Privacy Preserving Nearest Neighbor Search (2006)
Mark Shaneck, Yongdae Kim, Vipin Kumar, Mark Shaneck, Yongdae Kim
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA)...
Computational Approaches for Protein Function Prediction: A Survey (2006)
Gaurav P, Vipin Kumar, Michael Steinbach, Gaurav P, Vipin Kumar, Michael Steinbach
Proteins are the most essential and versatile macromolecules of life, and the knowledge of their functions is a crucial link in the development of new drugs, better crops, and even the development of...
Computational Approaches for Protein Function Prediction: A Survey (2006)
Gaurav P, Vipin Kumar, Michael Steinbach, Gaurav P, Vipin Kumar, Michael Steinbach
Proteins are the most essential and versatile macromolecules of life, and the knowledge of their functions is a crucial link in the development of new drugs, better crops, and even the development of...
A Multi-Step Framework for Detecting Attack Scenarios (2006)
Mark Shaneck, Varun Ch, Haiyang Liu, Changho Choi, Eric Eilertson, Yongdae Kim, ...
Abstract. With growing dependence upon interconnected networks, defending these networks against intrusions is becoming increasingly important. In the case of attacks that are composed of multiple...
Reply to "Backward Error Analysis ..." (2006)
Kettner, Lutz, Mehlhorn, Kurt, Pion, Sylvain, Schirra, Stefan, Yap, Chee, Gavrilova, Marina, ...
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may cause implementations...
Hui Xiong, Gaurav P, Michael Steinbach, Vipin Kumar, Hui Xiong, Gaurav P, ...
Removing objects that are noise is an important goal of data cleaning as noise hinders most types of data analysis. Most existing data cleaning methods focus on removing noise that is the result of...
Learning Perspective, Hui Xiong, Michael Steinbach, Vipin Kumar, H. Xiong (b, M. Steinbach, ...
Abstract In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensitive...
IDR/QR: An incremental dimension reduction algorithm via QR decomposition (2004)
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar
Dimension reduction is critical for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the literature, a well-known dimension reduction...
Detection and Summarization of Novel Network Attacks Using Data Mining (2004)
Levent Ertöz, Eric Eilertson, Aleksandar Lazarevic, Pang-Ning Tan, Paul Dokas, Vipin Kumar, ...
This paper introduces the Minnesota Intrusion Detection System (MINDS), which uses a suite of data mining techniques to automatically detect attacks against computer networks and systems. While the...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Kumar
Given a user-specified minimum correlation threshold # and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with correlations above...
IDR/QR: An Incremental Dimension Reduction Algorithm Via Qr Decomposition (2004)
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar
Dimension reduction is critical for many database and data mining applications, such as e#cient storage and retrieval of high-dimensional data. In the literature, a well-known dimension reduction...
IDR/QR: An incremental dimension reduction algorithm via QR decomposition (2004)
Jieping Ye, Hui Xiong, Student Member, Student Member, Student Member, Haesun Park, ...
Abstract—Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the...
IDR/QR: An incremental dimension reduction algorithm via QR decomposition (2004)
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Janardan, Vipin Kumar
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the literature, a...
B. Uygar Oztekin, Vipin Kumar, B. Uygar Oztekin
In this paper, we explore the possibility of incorporating usage statistics to improve ranking quality in site specific and intranet search engines. We introduce a number of usage based ranking...
Honda, Aki, Ametani, Akio, Matsumoto, Takashi, Iwaya, Amane, Kano, Hiroshi, Hachimura, Satoshi, ...
T cell responses directed toward TCR‐derived peptides have been shown to be an important regulatory mechanism of protection against autoimmunity. Here, we show that a naturally induced...
Christopher Potter, Pang-ning Tan, Michael Steinbach, Steven Klooster, Vipin Kumar, Ranga Myneni, ...
Abstract. Ecosystem scientists have yet to develop a proven methodology to monitor and understand major disturbance events and their historical regimes at a global scale. This study was conducted to...
Correlation Analysis of Spatial Time Series Datasets: A Filter-and-Refine Approach (2003)
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of interacting elements...
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially...
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
Abstract. A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially...
Correlation Analysis of Spatial Time Series Datasets: A Filter-and-Refine Approach (2003)
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
Abstract. A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially...
Mining Strong Affinity Association Patterns in Data Sets with Skewed Support (2003)
Hui Xiong, Pang-Ning Tan, Vipin Kumar
Existing association-rule mining algorithms often rely on the support-based pruning strategy to prune its combinatorial search space. This strategy is not quite effective for data sets with skewed...
Christopher Potter, Pang-ning Tan, Michael Steinbach, Vipin Kumar, Ranga Myneni, Vanessa Genovese
global satellite data sets
Hui Xiong, Shashi Shekhar, Pang-ning Tan, Vipin Kumar, Hui Xiong, Shashi Shekhar, ...
Given a user-specified minimum correlation threshold ¢ and a transaction database with £ items, all-strongpairs correlation query finds all item pairs with correlations above the threshold ¢....
Optimizing F-Measure with Support Vector Machines (2003)
David R. Musicant, Vipin Kumar, Aysel Ozgur
Support vector machines (SVMs) are regularly used for classification of unbalanced data by weighting more heavily the error contribution from the rare class. This heuristic technique is often used to...
Correlation Analysis of Spatial Time Series Datasets: A Filter-and-Refine Approach (2003)
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
Abstract. A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially...
A comparative study of anomaly detection schemes in network intrusion detection (2003)
Ar Lazarevic, Aysel Ozgur, Levent Ertoz, Jaideep Srivastava, Vipin Kumar
Abstract. Intrusion detection corresponds to a suite of techniques that can be used to identify attacks against computers and network infrastructures. Anomaly detection is a key element of intrusion...
Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data (2003)
Levent Ertöz, Michael Steinbach, Vipin Kumar
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and outliers. Many of these...
The challenges of clustering high-dimensional data (2003)
Michael Steinbach, Levent Ertöz, Vipin Kumar
Cluster analysis divides data into groups (clusters) for the purposes of summarization or improved understanding. For example, cluster analysis has been used to group related documents for browsing,...
3.2 Partitioning Meshes Directly....................................... 7 (2003)
George Karypis, Kirk Schloegel, Vipin Kumar
∗ PARMETIS is copyrighted by the regents of the University of Minnesota. 1
Pusheng Zhang, Yan Huang, Shashi Shekhar, Vipin Kumar
Abstract. A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially...
Hyperlink Analysis: Techniques and Applications (2002)
Prasanna Desikan, Jaideep Srivastava, Vipin Kumar, Pang-ning Tan, Related Work
ABSTRACT.................................................................................................................................................. 0
Selecting the Right Interestingness Measure for Association Patterns (2002)
Pang-ning Tan, Vipin Kumar, Jaideep Srivastava
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as support,...
Temporal Data Mining for the Discovery and Analysis of Ocean Climate Indices (2002)
Michael Steinbach, Steven Klooster, Pang-ning Tan, Christopher Potter, Vipin Kumar
To predict the effect of the oceans on land climate, Earth Scientists have developed ocean climate indices (OCIs), which are time series that summarize the behavior of selected areas of the...
Data mining for network intrusion detection (2002)
Paul Dokas, Levent Ertoz, Vipin Kumar, Ar Lazarevic, Jaideep Srivastava, Pang-ning Tan
This paper gives an overview of our research in building rare class prediction models for identifying known intrusions and their variations and anomaly/outlier detection schemes for detecting novel...
Personalized profile based search interface with ranked and clustered display (2001)
Sachin Kumar, B. Uygar Oztekin, Levent Ertoz, Saurabh Singhal, Euihong (sam Han, Vipin Kumar, ...
We have developed an experimental meta-search engine, which takes the snippets from traditional search engines and presents them to the user either in the form of clusters, indices or re-ranked list...
Finding Topics in Collections of Documents: A Shared Nearest Neighbor Approach (2001)
Levent Ertöz, Michael Steinbach, Vipin Kumar
An important task in text mining is finding the dominant topics (and their associated documents) in a collection of documents. While traditional clustering techniques, e.g., hierarchical clustering...
Kumar, Vipin, Maglione, Jeannie, Thatte, Jayant, Pederson, Brian, Sercarz, Eli, Ward, E. Sally
DNA vaccination has been used to generate effective cellular as well as humoral immunity against target antigens. Here we have investigated the induction and involvement of regulatory T cell (Treg)...
Load balancing across near-homogeneous multiresource servers (2000)
William Leinberger, William Leinberger, George Karypis, George Karypis, Vipin Kumar, Vipin Kumar, ...
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
A unified algorithm for load-balancing adaptive scientific simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar
inter-processorcommunicationsincurredduringtheiterativemesh-basedcomputationandthedatare-thecourseofthecomputation.Therepartitioningsshouldbecomputedsoastominimizeboththe...
Graph partitioning for high performance scientific simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar, Morgan Kaufmann, Early Draft
Interestingness Measures for Association Patterns: A Perspective (2000)
Department of Computer Science, University of Minnesota,
A comparison of document clustering techniques (2000)
Michael Steinbach, George Karypis, Vipin Kumar
This paper presents the results of an experimental study of some common document clustering techniques: agglomerative hierarchical clustering and K-means. (We used both a “standard” K-means...
Abstract A Comparison of Document Clustering Techniques (2000)
Michael Steinbach, George Karypis, Vipin Kumar, Michael Steinbach, George Karypis, Vipin Kumar
This paper presents the results of an experimental study of some common document clustering techniques. In particular, we compare the two main approaches to document clustering, agglomerative...
A unified algorithm for load-balancing adaptive scientific simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to minimize both the...
Load balancing across near-homogeneous multiresource servers (2000)
William Leinberger, George Karypis, Vipin Kumar, Rupak Biswas
An emerging model for computational grids interconnects similar multi-resource servers from distributed sites. A job submitted to the grid can be executed by any of the servers; however, resource...
A unified algorithm for load-balancing adaptive scientific simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the computation. The repartitionings should be computed so as to minimize both the...
A Comparison of Document Clustering Techniques (2000)
Michael Steinbach, George Karypis, Vipin Kumar
This paper presents the results of an experimental study of some common document clustering techniques. In particular, we compare the two main approaches to document clustering, agglomerative...
Modeling of Web Robot Navigational Patterns (2000)
In recent years, it is becoming increasingly difficult to ignore the impact of Web robots on both commercial and institutional Web sites. Not only do Web robots consume valuable bandwidth and Web...
Parallel Algorithms in Data Mining (2000)
Mahesh V. Joshi, Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
Introduction Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven techniques of...
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations (2000)
Kirk Schloegel And, Kirk Schloegel, George Karypis, Vipin Kumar
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the simulation. The computed repartitionings should minimize both the inter-processor...
Interestingness Measures for Association Patterns: A Perspective (2000)
Association rules are valuable patterns because they offer useful insight into the types of dependencies that exist between attributes of a data set. Due to the completeness nature of algorithms for...
Graph Partitioning for High Performance Scientific Simulations (2000)
Kirk Schloegel George, George Karypis, Vipin Kumar, J. Dongarra, I. Foster, G. Fox, ...
Contents 0.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 0.2 Modeling Mesh-based Computations as Graphs . . . . . . . . . . . . . . . ....
Graph Partitioning for High Performance Scientific Simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar, J. Dongarra, I. Foster, G. Fox, ...
Contents 0.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 0.2 Modeling Mesh-based Computations as Graphs . . . . . . . . . . . . . . . ....
Indirect Association: Mining Higher Order Dependencies in Data (2000)
Pang-ning Tan, Vipin Kumar, Jaideep Srivastava
. This paper introduces the concept of indirect association between items and examines its utility in various application domains. Existing algorithms for mining association rules, such as Apriori,...
A Unified Algorithm for Load-balancing Adaptive Scientific Simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar
Adaptive scientific simulations require that periodic repartitioning occur dynamically throughout the course of the simulation. The computed repartitionings should minimize both the inter-processor...
Graph Partitioning for High Performance Scientific Simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar, J. Dongarra, I. Foster, G. Fox, ...
Contents 0.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 0.2 Modeling Mesh-based Computations as Graphs . . . . . . . . . . . . . . . ....
A unified algorithm for load-balancing adaptive scientific simulations (2000)
Kirk Schloegel, George Karypis, Vipin Kumar
( kirk, karypis, kumar) @ cs.umn.edu
Multilevel k-way Hypergraph Partitioning (2000)
In this paper, we present a new multilevel k-way hypergraph partitioning algorithm that substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way partitioning, both for...
ANewAlgorithmforMulti-objectiveGraphPartitioning (1999)
Vipin Kumar, George Karypis, Kirk Schloegel
isthoseinwhichmultipleobjectives,eachofwhichcanbemodeledasasumofweightsoftheedgesofa thatthetraditionalgraphpartitioningmodelalonecannoteectivelyhandle.Onesuchclassofproblems...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification (1999)
Euihong (sam Han, George Karypis, Vipin Kumar, Vipin Kumar
Categorization of documents is challenging, as the number of discriminating words can be very large. We present a nearest neighbor classification scheme for text categorization in which the...
Tutorial on High Performance Data Mining (1999)
Vipin Kumar, Mahesh V. Joshi, Pang-ning Tan
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven techniques of...
Partitioning-based clustering for web document categorization. Decision Support Systems (1999)
Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
Clustering techniques have been used by manyintelligent software agents in order to retrieve, lter, and categorize documents available on the World Wide Web. Clustering is also useful in extracting...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification (1999)
Abstract. Automatic text categorization is an important task that can help people finding information on huge online resources. Text categorization presents unique challenges due to the large number...
A new algorithm for multi-objective graph partitioning (1999)
Kirk Schloegel, George Karypis, Vipin Kumar
( kirk, karypis, kumar) @ cs.umn.edu
PSPASES: An efficient and scalable parallel sparse direct solver (1999)
Mahesh Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred Gustavson
Many problems in engineering and scientific domains require solving large sparse systems of linear equations, as a computationally intensivesteptowards the final solution. It has long beenachallenge...
Partitioning-Based Clustering for Web Document Categorization (1999)
Daniel Boley Maria, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
Partitioning-Based Clustering for Web Document Categorization (1999)
Daniel Boley Maria, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
Parallel Multilevel Algorithms for Multi-Constraint Graph Partitioning (1999)
Kirk Schloegel And, Kirk Schloegel, George Karypis, Vipin Kumar
Recently, sequential multi-constraint graph partitioning algorithms have been developed to address the load balancing requirements of emerging multi-phase and multi-physics scientific simulation...
Partitioning-Based Clustering for Web Document Categorization (1999)
Daniel Boley Maria, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
A Universal Formulation of Sequential Patterns (1999)
Mahesh Joshi, George Karypis, Vipin Kumar
This report outlines a more general formulation of sequential patterns, which uni#es the generalized patterns proposed by Srikant and Agarwal #SA96# and episode discovery approach taken by Manilla et...
CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling (1999)
George Karypis, Eui-Hong (Sam) Han, Vipin Kumar
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. Existing clustering...
A New Algorithm for Multi-objective Graph Partitioning (1999)
Kirk Schloegel George, George Karypis, Vipin Kumar
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot effectively handle. One such class of...
Parallel Multilevel Algorithms for Multi-Constraint Graph Partitioning (1999)
Kirk Schloegel, George Karypis, Vipin Kumar
Recently, sequential multi-constraint graph partitioning algorithms have been developed to address the load balancing requirements of emerging multi-phase and multi-physics scientific simulation...
Document Categorization and Query Generation on the World Wide Web Using WebACE (1999)
Daniel Boley, Maria Gini, Robert Gross, Eui-Hong (Sam) Han, Kyle Hastings, George Karypis, ...
We present WebACE, an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an unsupervised categorization of a set of documents,...
Parallel Multilevel Algorithms for Multi-Constraint Graph Partitioning (1999)
Kirk Schloegel And, Kirk Schloegel, George Karypis, Vipin Kumar
Recently, sequential multi-constraint graph partitioning algorithms have been developed to address the load balancing requirements of emerging multi-phase and multi-physics scientific simulation...
PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver (1999)
Mahesh Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred Gustavson
Many problems in engineering and scientific domains require solving large sparse systems of linear equations, as a computationally intensive step towards the final solution. It has long been a...
Multilevel Refinement for Hierarchical Clustering (1999)
George Karypis, Eui-hong (Sam) Han, Vipin Kumar
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in...
Multilevel Refinement for Hierarchical Clustering (1999)
George Karypis, Eui-Hong (Sam) Han, Vipin Kumar
Hierarchical methods are well known clustering technique that can be potentially very useful for various data mining tasks. A hierarchical clustering scheme produces a sequence of clusterings in...
Partitioning-Based Clustering for Web Document Categorization (1999)
Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
A Universal Formulation of Sequential Patterns (1999)
Mahesh Joshi, George Karypis, Vipin Kumar
This report outlines a more general formulation of sequential patterns, which unifies the generalized patterns proposed by Srikant and Agarwal [SA96] and episode discovery approach taken by Manilla...
CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling (1999)
George Karypis, Eui-Hong (Sam) Han, Vipin Kumar
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. Existing clustering...
A Universal Formulation of Sequential Patterns (1999)
Mahesh Joshi George, George Karypis, Vipin Kumar
This report outlines a more general formulation of sequential patterns, which unifies the generalized patterns proposed by Srikant and Agarwal [SA96] and episode discovery approach taken by Manilla...
A New Algorithm for Multi-objective Graph Partitioning (1999)
Kirk Schloegel, George Karypis, Vipin Kumar
. Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot effectively handle. One such class of...
A New Algorithm for Multi-objective Graph Partitioning (1999)
Kirk Schloegel, George Karypis, Vipin Kumar
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot effectively handle. One such class of...
Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification (1999)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
Text categorization is the task of deciding whether a document belongs to a set of prespecified classes of documents. Automatic classification schemes can greatly facilitate the process of...
Document Categorization and Query Generation on the World Wide Web Using WebACE (1999)
Daniel Boley Maria, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
We present WebACE, an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an unsupervised categorization of a set of documents,...
Document Categorization and Query Generation on the World Wide Web Using WebACE (1999)
Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
We present WebACE, an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an unsupervised categorization of a set of documents,...
A new algorithm for multi-objective graph partitioning (1999)
Kirk Schloegel, George Karypis, Vipin Kumar
( kirk, karypis, kumar) @ cs.umn.edu
William Leinberger, George Karypis, Vipin Kumar
In past massively parallel processing systems, such as the Intel Paragon and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting jobs; the...
A fast and high quality multilevel scheme for partitioning irregular graphs (1998)
Abstract. Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph,...
Multilevel algorithms for multi-constraint graph partitioning (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
( kirk, karypis, kumar) @ cs.umn.edu
Multilevel algorithms for multi-constraint graph partitioning (1998)
Traditional graph partitioning algorithms compute a k-way partitioning of a graph such that the number of edges that are cut by the partitioning is minimized and each partition has an equal number of...
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering (1998)
In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other...
Multilevel k-way partitioning scheme for irregular graphs (1998)
In this paper we present and study a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, find a k-way partitioning of the smaller graph, and...
Multilevel k-way partitioning scheme for irregular graphs (1998)
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices...
A fast and high quality multilevel scheme for partitioning irregular graphs (1998)
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then...
Multilevel algorithms for multi-constraint graph partitioning (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
Sequential multi-constraint graph partitioning algorithms havebeendeveloped to address the load balancing requirements of multi-phase simulations. The efficient execution of large multi-phase...
A fast and high quality multilevel scheme for partitioning irregular graphs (1998)
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then...
Appears in the Journal of Parallel and Distributed Computing (1998)
Short Version Of, George Karypis, Vipin Kumar
In this paper we present a parallel formulation of the multilevel graph partitioning and sparse matrix ordering algorithm. A key feature of our parallel formulation (that distinguishes it from other...
Mahesh V. Joshi, George Karypis, Vipin Kumar
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision tree classifiers...
A fast and high quality multilevel scheme for partitioning irregular graphs (1998)
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then...
Mahesh V. Joshi, George Karypis, Vipin Kumar
In this paper, we present ScalParC #Scalable Parallel Classi#er#, a new parallel formulation of a decision tree based classi#cation process. Like other state-of-the-art decision tree classi#ers such...
Multilevel k-way partitioning scheme for irregular graphs (1998)
In this paper we present and study a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, find a k-way partitioning of the smaller graph, and...
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
Existing state-of-the-art schemes for dynamic repartitioning of adaptive meshes can be classified as either diffusion-based schemes or scratch-remap schemes. We present a new scratch-remap scheme...
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
Existing state-of-the-art schemes for dynamic repartitioning of adaptive meshes can be classi#ed as either di#usion-based schemes or scratch-remap schemes. We present a new scratch-remap scheme...
Metis Mee Tis, George Karypis, Vipin Kumar
Contents 1 Introduction 3 2 What is METIS 4 3 What is New in This Version 6 4 METIS's Stand-Alone Programs 8 4.1 Graph Partitioning Programs . . . . . . . . . . . . . . . . . . . . . . . . . . ....
Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
Existing state-of-the-art schemes for dynamic repartitioning of adaptive meshes can be classified as either diffusion-based schemes or scratch-remap schemes. We present a new scratch-remap scheme...
Mahesh V. Joshi, George Karypis, Vipin Kumar
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision tree classifiers...
WebACE: A Web Agent for Document Categorization and Exploration (1998)
Eui-Hong Han, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, ...
We propose an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an automatic categorization of a set of documents, combined with...
Hypergraph Based Clustering in High-Dimensional Data Sets: A Summary of Results (1998)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar, Bamshad Mobasher
Clustering of data in a large dimension space is of a great interest in many data mining applications. In this paper, we propose a method for clustering of data in a high dimensional space based on a...
WebACE: A Web Agent for Document Categorization and Exploration (1998)
Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
We propose an agent for exploring and categorizing documents on the World Wide Web based on a user pro#le. The heart of the agent is an automatic categorization of a set of documents, combined with a...
T-cell vaccination in Experimental Autoimmune Encephalomyelitis: A mathematical model (1998)
T-cell vaccination (TCV) is a method to induce resistance to autoimmune diseases by priming the immune system with autoreactive T cells. This priming evokes an anti-idiotypic regulatory T-cell...
A Fast And High Quality Multilevel Scheme For Partitioning Irregular Graphs (1998)
.<F3.819e+05> Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the...
Multilevel k-way Hypergraph Partitioning (1998)
In this paper, we present a new multilevel k-way hypergraph partitioning algorithm that substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way partitioning. both for...
Multilevel algorithms for multi-constraint graph partitioning (1998)
Kirk Schloegel, George Karypis, Vipin Kumar
Sequential multi-constraint graph partitioning algorithms have beendeveloped to address the load balancing requirements of multi-phase simulations. The e cient execution of large multi-phase...
T Cell Vaccination in Experimental Autoimmune (1998)
Encephalomyelitis Mathematical Model, Eli Sercarz, Vipin Kumar
this article were defrayed in part by the payment of page charges. This article must therefore be hereby marked advertisement in accordance with 18 U.S.C. Section 1734 solely to indicate this fact
Multilevel hypergraph partitioning: Application in VLSI domain (1997)
George Karypis, Rajat Aggarwal, Vipin Kumar, Senior Member, Shashi Shekhar, Senior Member
Abstract — In this paper, we present a new hypergraphpartitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is...
Multilevel hypergraph partitioning: Application in VLSI domain (1997)
George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed....
Jerome Moore, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm (1997)
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latency. The multilevel...
Multilevel hypergraph partitioning: Application in VLSI domain (1997)
George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed....
Anshul Gupta, Fred Gustavson, Mahesh Joshi, George Karypis, Vipin Kumar
Solving large sparse systems of linear equations is at the core of many problems in engineering and scientific computing. It has long been a challenge to develop parallel formulations of sparse...
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes (1997)
Kirk Schloegel George, George Karypis, Vipin Kumar
For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be...
Scalable Parallel Data Mining for Association Rules (1997)
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in...
Jerome Moore, Eui-Hong Han, Daniel Boley, Maria Gini, Robert Gross, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
Th Siam Conference, George Karypis, Vipin Kumar
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for message-passing libraries that have high latency. The multilevel...
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes (1997)
Kirk Schloegel, George Karypis, Vipin Kumar
For a large class of irregular grid applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the graph evolves, the adapted mesh has to be...
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes (1997)
Kirk Schloegel, George Karypis, Vipin Kumar
For a large class of irregular grid applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the graph evolves, the adapted mesh has to be...
Min-Apriori: An Algorithm for Finding Association Rules in Data with Continuous Attributes (1997)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
this paper, we propose a new algorithm to discover association rules in the type of data set discussed in the above paragraph.
A Coarse-Grain Parallel Formulation of Multilevel . . . (1997)
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for high latency message-passing libraries. The multilevel k-way...
Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes (1997)
Kirk Schloegel, George Karypis, Vipin Kumar
Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the...
Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes (1997)
Kirk Schloegel George, George Karypis, Vipin Kumar
For a large class of irregular grid applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the graph evolves, the adapted mesh has to be...
Scalable Parallel Data Mining for Association Rules (1997)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consuming operation in...
Jerome Moore, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, ...
Clustering techniques have been used by manyintelligent software agents in order to retrieve, #lter, and categorize documents available on the World Wide Web. Clustering is also useful in extracting...
Jerome Moore, Eui-Hong (Sam) Han, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, ...
Clustering techniques have been used by many intelligent software agents in order to retrieve, filter, and categorize documents available on the World Wide Web. Clustering is also useful in...
Wssmp Watson, Mahesh Joshi, Vipin Kumar, Anshul Gupta, Anshul Gupta
This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its...
WSSMP: Watson Symmetric Sparse Matrix Package The User Interface: Version 4.0.1 (1997)
Mahesh Joshi, Vipin Kumar, Anshul Gupta, Anshul Gupta
This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its...
Scalable Parallel Data Mining for Association Rules (1997)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
In this paper we propose two new parallel formulations of the Apriori algorithm that is used for computing association rules. These new formulations, IDD and HD, address the shortcomings of two...
Parallel Hierarchical Solvers and Preconditioners for Boundary Element Methods (1997)
Ananth Grama, Vipin Kumar, Ahmed Sameh
The method of moments is an important tool for solving boundary integral equations arising in a variety of applications. It transforms the physical problem into a dense linear system. Due to the...
Multilevel hypergraph partitioning: Application in VLSI domain (1997)
George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed....
Parallel Formulations of Inductive Classification Learning Algorithm (1996)
Eui-Hong (Sam) Han, Anurag Srivastava, Vipin Kumar
One of the important problems in data mining [SAD + 93] is the classification--rule learning. The classification--rule learning involves finding rules or decision trees that partition given data into...
Parallel Threshold-based ILU Factorization (1996)
Factorization algorithms based on threshold incomplete LU factorization have been found to be quite effective in preconditioning iterative system solvers. However, their parallel formulations have...
Visual Data Mining: Framework and Algorithm Development (1996)
M. Ganesh, Eui-Hong (Sam) Han, Vipin Kumar, Shashi Shekhar, Jaideep Srivastava
Visual data mining is the use of visualization techniques to allow data miners and analysts to evaluate, monitor, and guide the inputs, products and process of data mining. It can help introduce user...
Search Framework for Mining Classification Decision Trees (1996)
Eui-Hong (Sam) Han, Shashi Shekhar, Vipin Kumar, M. Ganesh, Jaideep Srivastava
Classification-rule-learning task is presented as a search process of finding a classification-decision tree that meets users' preferences and requirements. Users can control the efficiency of...
Ananth Grama, Vipin Kumar, Ahmed Sameh
) Ananth Grama, Vipin Kumar, Ahmed Sameh Department of Computer Science, University of Minnesota Minneapolis, MN 55455 {ananth, kumar, sameh}@cs.umn.edu Abstract In this paper, we report results of...
Parallel Threshold-based ILU Factorization (1996)
this paper we show that highly parallel graph partitioning algorithms in conjunction with parallel algorithms for computing maximal independent sets can be used to develop scalable parallel...
Analysis of multilevel graph partitioning (1995)
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide excellent graph...
Analysis of multilevel graph partitioning (1995)
Permission to make digital or hard copies of part or all of this work or personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial...
Anshul Gupta, Vipin Kumar, Ahmed Sameh
This paper analyzes the performance and scalability of an iteration of the Preconditioned Conjugate Gradient Algorithm on parallel architectures with a variety of interconnection networks, such as...
Very Fast Motion Planning for Dexterous Robots (1995)
Daniel Challou, Maria Gini, Vipin Kumar, Curtis Olson
We show that paths for dexterous robots can be generated in a few seconds or less using parallel informed randomized search on multicomputers. The experimental results we present have been obtained...
A Parallel Formulation of Informed Randomized Search for Robot Motion Planning Problems (1995)
Daniel Challou, Daniel Boley, Maria Gini, Vipin Kumar
We show how paths for articulated robots with many degrees of freedom can be generated in a few seconds or less using nonsystematic parallel search. We present experimental results obtained on a...
METIS - Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0 (1995)
this paper is organized as follows: Section 2 briefly describes the various ideas and algorithms implemented in METIS. Section 3 describes the user interface to the METIS graph partitioning and...
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization (1995)
Anshul Gupta, George Karypis, Vipin Kumar
In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a...
n-Body Simulations Using Message Passing Parallel Computers (1995)
Ananth Y. Grama, Vipin Kumar, Ahmad Sameh
In this paper, we present new parallel formulations of the Barnes-Hut method for n-body simulations on message passing computers. These parallel formulations partition the domain efficiently...
Parallel Multilevel Graph Partitioning (1995)
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm...
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods (1995)
Ananth Grama, Vipin Kumar, Ahmed Sameh
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used in electromagnetics,...
A few parallel algorithms for solving triangular systems resulting from parallel factorization of sparse linear systems have been proposed and implemented recently. We present a detailed analysis of...
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods (1995)
Ananth Grama, Vipin Kumar, Ahmed Sameh
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used in electromagnetics,...
Load-Balancing in High Performance GIS: Declustering Polygonal Maps (1995)
Vipin Kumar, Douglas Chubb, Greg Turner, Shashi Shekhar, Shashi Shekhar, Sivakumar Ravada, ...
A high performance geographic information system (GIS) is a central component of many real-time applications of spatial decision making. The GIS may contain gigabytes of geometric and feature data...
Multilevel Graph Partitioning Schemes (1995)
Abstract – In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and...
Analysis of multilevel graph partitioning (1995)
In this paper we present a parallel formulation of a graph partitioning and sparse matrix ordering algorithm that is based on a multilevel algorithm we developed recently. Our parallel algorithm...
A parallel parsing algorithm for natural language using tree adjoining grammar (1994)
Dee Adjoining Grammar (TAG) is a powerful grammatical formalism for large-scale natural lan-guage processing. However, the computational com-plexity of parsing algorithms for TAG is high. We...
A high performance sparse Cholesky factorization algorithm for scalable parallel computers (1994)
Abstract This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently...
1 Introduction Linear programming is of fundamental importance in many optimization problems. The simplex method [4] is a commonly used way of solving linear programming problems. Solving large...
Highly scalable parallel algorithms for sparse matrix factorization (1994)
Anshul Gupta, George Karypis, Vipin Kumar
In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a...
Highly scalable parallel algorithms for sparse matrix factorization (1994)
Anshul Gupta, George Karypis, Vipin Kumar
In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a...
Highly scalable parallel algorithms for sparse matrix factorization (1994)
Anshul Gupta, George Karypis, Vipin Kumar
In this paper, we describe scalable parallel algorithms for sparse matrix factorization, analyze their performance and scalability, and present experimental results for up to 1024 processors on a...
Vipin Kumar, Shashi Shekhar, Minesh B. Amin
In this paper, we present a new technique for mapping the backpropagation algorithm on hypercubes and related architectures. A key component of this technique is a network partitioning scheme which...
Anshul Gupta Vipin, Anshul Gupta, Vipin Kumar, Ahmed Sameh
This paper analyzes the performance and scalability of an iteration of the Preconditioned Conjugate Gradient Algorithm on parallel architectures with a variety of interconnection networks, such as...
George Karypis and Vipin Kumar Computer Science Department University of Minnesota May 21, 1994 1 Introduction Linear programming is of fundamental importance in many optimization problems. The...
A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers (1994)
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcubemapping of another recently...
A High Performance Sparse Cholesky Factorization Algorithm For Scalable Parallel Computers (1994)
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced...
Toward Real-Time Motion Planning (1994)
W. J. Maas, Daniel J. Challou, Maria Gini, Vipin Kumar
We show that parallel search techniques derived from their sequential counterparts can enable the solution of motion planning problems that are computationally impractical on sequential machines. We...
A High Performance Sparse Cholesky Factorization Algorithm for Scalable Parallel Computers (1994)
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced...
Scalable Load Balancing Techniques for Parallel Computers (1994)
Vipin Kumar, Ananth Y. Grama, Vempaty Nageshwara Rao
In this paper we analyze the scalability of a number of load balancing algorithms which can be applied to problems that have the following characteristics : the work done by a processor can be...
The Performance of a Highly Unstructured Parallel Algorithm on the KSR1 (1994)
This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing...
Scalable Parallel Formulations of the Barnes-Hut Method for (1994)
Body Simulations Ananth, Ananth Y. Grama, Vipin Kumar, Ahmed Sameh
In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present...
A Scalable Parallel Algorithm for Sparse Matrix Factorization (1994)
In this paper, we describe a scalable parallel algorithm for sparse matrix factorization, analyze its performance and scalability, and present experimental results of its implementation on a...
Unstructured Tree Search on SIMD Parallel Computers (1994)
In this paper, we present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient...
Analyzing Scalability of Parallel Algorithms and Architectures (1994)
The scalability of a parallel algorithm on a parallel architecture is a measure of its capacity to effectively utilize an increasing number of processors. Scalability analysis may be used to select...
Scalable Parallel Formulations of the Barnes-Hut Method for (1994)
Body Simulations, Ananth Y. Grama, Vipin Kumar, Ahmed Sameh
In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present...
Scalable Parallel Formulations of the Barnes-Hut Method for n-Body Simulations (1994)
Ananth Grama, Vipin Kumar, Ahmed Sameh
In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present...
A Parallel Parsing Algorithm for Natural Language using Tree Adjoining Grammar (1994)
Tree Adjoining Grammar (TAG) is a powerful grammatical formalism for large-scale natural language processing. However, the computational complexity of parsing algorithms for TAG is high. We introduce...
A Parallel Formulation of Interior Point Algorithms (1994)
George Karypis, Anshul Gupta, Vipin Kumar
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming (LP) problems. In this paper we describe a highly parallel formulation of the...
Anshul Gupta, Vipin Kumar, Ahmed Sameh
This paper analyzes the performance and scalability of an iteration of the Preconditioned Conjugate Gradient Algorithm on parallel architectures with a variety of interconnection networks such as the...
A Parallel Formulation of Interior Point (1994)
Algorithms George Karypis, George Karypis, Anshul Gupta, Vipin Kumar
In recentyears, interior point algorithms have been used successfully for solving mediumto large-size linear programming #LP# problems. In this paper we describe a highly parallel formulation of the...
Scalable load balancing techniques for parallel computers (1994)
Abstract In this paper we analyze the scalability of a number of load balancing algorithms which can be applied to problems that have the following characteristics: the work done by a processor can...
Parallel Processing of Discrete Optimization Problems (1993)
Grama Ananth And, Grama Y. Ananth, Vipin Kumar, Panos Pardalos
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is...
The Scalability of FFT on Parallel Computers (1993)
In this paper, we present the scalability analysis of parallel Fast Fourier Transform algorithm on mesh and hypercube connected multicomputers using the isoefficiency metric. The isoefficiency...
A Survey of Parallel Search Algorithms for Discrete Optimization Problems (1993)
Ananth Grama And, Ananth Y. Grama, Vipin Kumar
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is...
Isoefficiency Function: A Scalability Metric for Parallel Algorithms and Architectures (1993)
Ananth Grama, Anshul Gupta, Vipin Kumar
This paper provides a tutorial introduction to a performance evaluation metric called the isoefficiency function. Traditional methods for evaluating serial algorithms are inadequate for analyzing the...
Efficient Parallel Formulations for Some Dynamic Programming Algorithms (1993)
In this paper we are concerned with Dynamic Programming (DP) algorithms whose solution is given by a recurrence relation similar to that for the matrix parenthesization problem. Guibas, Kung and...
A Survey of Parallel Search Algorithms for Discrete Optimization Problems (1993)
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is...
Performance Properties of Large Scale Parallel Systems (1993)
A. Gupta, Anshul Gupta, Vipin Kumar
There are several metrics that characterize the performance of a parallel system, such as, parallel execution time, speedup and efficiency. A number of properties of these metrics have been studied....
Parallel processing of discrete optimization problems (1993)
Department of Computer Science,
On the Efficiency of Parallel Backtracking (1992)
V. Nageshwara Rao, Vipin Kumar
It is known that isolated executions of parallel backtrack search exhibit speedup anomalies. In this paper we present analytical models and experimental results on the average case behavior of...
Algorithms for Constraint Satisfaction Problems: A Survey (1992)
A large variety of problems in Artificial Intelligence and other areas of computer science can be viewed as a special case of the constraint satisfaction problem. Some examples are machine vision,...
Parallel Processing of Discrete Optimization Problems (1992)
Grama Y. Ananth, Vipin Kumar, Panos Pardalos
Discrete optimization problems (DOPs) arise in various applications such as planning, scheduling, computer aided design, robotics, game playing and constraint directed reasoning. Often, a DOP is...
Scalability Analysis of Partitioning Strategies for Finite Element Graphs. (1992)
Grama Ananth, Vipin Kumar, Ananth Y. Grama
Issues of partitioning Finite Element Graphs are central to parallel formulations of the Finite Element Method. Due to the nature of the problem, optimal partitioning schemes should conform to three...
Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem (1991)
This paper uses the isoefficiency metric to analyze the scalability of several parallel algorithms for finding shortest paths between all pairs of nodes in a densely connected graph. Parallel...
Scalability of Parallel Algorithms for Matrix Multiplication (1991)
A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near...
Concurrent Access of Priority Queues (1988)
The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branch-and-bound). In these algorithms, contention for the...
Parallel Best-First Search of State-Space Graphs: A Summary of Results (1988)
Vipin Kumar, K. Ramesh, V. Nageshwara Rao
This paper presents many different parallel formulations of the A*/Branch-and-Bound search algorithm. The parallel formulations primarily differ in the data structures used. Some formulations are...
Clustering In A High-Dimensional Space Using Hypergraph Models (1987)
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar, Bamshad Mobasher
Clustering of data in a large dimension space is of a great interest in many data mining applications. Most of the traditional algorithms such as K-means or AutoClass fail to produce meaningful...
Efficient Parallel Algorithms for Mining Associations
Mahesh V. Joshi, Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
. The problem of mining hidden associations present in the large amounts of data has seen widespread applications in many practical domains such as customer-oriented planning and marketing,...
Efficient Parallel Algorithms for Mining Associations
Mahesh V. Joshi, Eui-Hong (Sam) Han, George Karypis, Vipin Kumar
. The problem of mining hidden associations present in the large amounts of data has seen widespread applications in many practical domains such as customer-oriented planning and marketing,...
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
Vipin Kumar, Douglas Chubb, Greg Turner, Shashi Shekhar, Shashi Shekhar, Sivakumar Ravada, ...
Declustering and load-balancing are important issues in designing a high performance geographic information system (HPGIS) which is a central component of many interactive applications such as...
Multilevel Algorithms for Multi-Constraint Graph Partitioning
George Karypis And, George Karypis, Vipin Kumar
Traditional graph partitioning algorithms compute a k-way partitioning of a graph such that the number of edges that are cut by the partitioning is minimized and each partition has an equal number of...
Mahesh Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred Gustavson
Introduction PSPASES (Parallel SPArse Symmetric dirEct Solver) is a MPI-based parallel stand-alone library intended to solve a system of linear equations, AX = B, where A is a sparse symmetric...
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
Vipin Kumar, Douglas Chubb, Greg Turner, Shashi Shekhar, Shashi Shekhar, Sivakumar Ravada, ...
Declustering and load-balancing are important issues in designing a high performance geographic information system (HPGIS) which is a central component of many interactive applications such as...
Clustering Based On Association Rule Hypergraphs
Eui-Hong (Sam) Han, George Karypis, Vipin Kumar, Bamshad Mobasher
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These discovered clusters...
A Scalable Parallel Algorithm for Sparse Cholesky Factorization
In this paper, we describe a scalable parallel algorithm for sparse Cholesky factorization, analyze its performance and scalability, and present experimental results of its implementation on a...
WebACE: A Web Agent for Document Categorization and Exploration
Eui-Hong Sam, Daniel Boley, Maria Gini, Robert Gross, Kyle Hastings, George Karypis, ...
We propose an agent for exploring and categorizing documents on the World Wide Web based on a user profile. The heart of the agent is an automatic categorization of a set of documents, combined with...
Parallel Depth First Search, Part I: Implementation
V. Nageshwara Rao, Vipin Kumar
This paper presents a parallel formulation of depth-first search which retains the storage efficiency of sequential depth-first search and can be mapped on to any MIMD architecture. To study its...
Parallel Depth First Search, Part II: Analysis
Vipin Kumar, V. Nageshwara Rao
This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between...
Mahesh Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred Gustavson
Introduction PSPASES (Parallel SPArse Symmetric dirEct Solver) is a MPI-based parallel stand-alone library intended to solve a system of linear equations, AX = B, where A is a sparse symmetric...