2009 | ||
---|---|---|
123 | EE | Huzefa Rangwala, Christopher Kauffman, George Karypis: A Kernel Framework for Protein Residue Annotation. PAKDD 2009: 439-451 |
122 | EE | Jianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal: CONTOUR: an efficient algorithm for discovering discriminating subsequences. Data Min. Knowl. Discov. 18(1): 1-29 (2009) |
2008 | ||
121 | EE | Huzefa Rangwala, George Karypis: fRMSDAlign: Protein Sequence Alignment Using Predicted Local Structure Information for Pairs with Low Sequence Identity. APBC 2008: 111-122 |
120 | EE | Rezwan Ahmed, Huzefa Rangwala, George Karypis: TOPTMH: Topology Predictor for Transmembrane alpha-Helices. ECML/PKDD (1) 2008: 23-38 |
119 | EE | Irene Moulitsas, George Karypis: Architecture Aware Partitioning Algorithms. ICA3PP 2008: 42-53 |
118 | EE | Xia Ning, George Karypis: The Set Classification Problem and Solution Methods. ICDM Workshops 2008: 720-729 |
117 | EE | Christopher Kauffman, George Karypis: An Analysis of Information Content Present in Protein-DNA Interactions. Pacific Symposium on Biocomputing 2008: 477-488 |
116 | EE | Nikil Wale, Ian A. Watson, George Karypis: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14(3): 347-375 (2008) |
115 | EE | Mohammed J. Zaki, George Karypis, Jiong Yang, Wei Wang: Introduction to special issue on bioinformatics. TKDD 2(1): (2008) |
2007 | ||
114 | EE | Steve Reinhardt, George Karypis: A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph. IPDPS 2007: 1-8 |
113 | EE | Jianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Karypis, Charu C. Aggarwal: Discriminating Subsequence Discovery for Sequence Clustering. SDM 2007 |
112 | EE | Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis: Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans. Database Syst. 32(2): 13 (2007) |
111 | EE | Huzefa Rangwala, George Karypis: Incremental window-based protein sequence alignment algorithms. Bioinformatics 23(2): 17-23 (2007) |
110 | EE | Michihiro Kuramochi, George Karypis: Discovering frequent geometric subgraphs. Inf. Syst. 32(8): 1101-1120 (2007) |
109 | EE | Kevin W. Deronne, George Karypis: Effective Optimization Algorithms for Fragment-Assembly Based protein Structure Prediction. J. Bioinformatics and Computational Biology 5(2a): 335-352 (2007) |
2006 | ||
108 | EE | Nikil Wale, George Karypis: Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification. ICDM 2006: 678-689 |
107 | EE | Amine Abou-Rjeili, George Karypis: Multilevel algorithms for partitioning power-law graphs. IPDPS 2006 |
106 | EE | Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Karypis: Coherent closed quasi-clique discovery from large dense graph databases. KDD 2006: 797-802 |
105 | EE | Al Mamunur Rashid, Shyong K. Lam, Adam LaPitz, George Karypis, John Riedl: Towards a Scalable k NN CF Algorithm: Exploring Effective Applications of Clustering. WEBKDD 2006: 147-166 |
104 | EE | Jianyong Wang, George Karypis: On Mining Instance-Centric Classification Rules. IEEE Trans. Knowl. Data Eng. 18(11): 1497-1511 (2006) |
103 | EE | Navaratnasothie Selvakkumaran, George Karypis: Multiobjective hypergraph-partitioning algorithms for cut and maximum subdomain-degree minimization. IEEE Trans. on CAD of Integrated Circuits and Systems 25(3): 504-517 (2006) |
102 | EE | Jianyong Wang, George Karypis: On efficiently summarizing categorical databases. Knowl. Inf. Syst. 9(1): 19-37 (2006) |
101 | EE | Mohammed J. Zaki, George Karypis, Jiong Yang: BIOKDD06: data mining in Bioinformatics. SIGKDD Explorations 8(2): 78 (2006) |
2005 | ||
100 | EE | Eui-Hong Han, George Karypis: Feature-based recommendation system. CIKM 2005: 446-452 |
99 | Jack G. Conrad, Khalid Al-Kofahi, Ying Zhao, George Karypis: Effective Document Clustering for Large Heterogeneous Law Firm Collections. ICAIL 2005: 177-187 | |
98 | Jianyong Wang, George Karypis: HARMONY: Efficiently Mining the Best Rules for Classification. SDM 2005 | |
97 | Al Mamunur Rashid, George Karypis, John Riedl: Influence in Ratings-Based Recommender Systems: An Algorithm-Independent Approach. SDM 2005 | |
96 | Ying Zhao, George Karypis: Topic-driven Clustering for Document Datasets. SDM 2005 | |
95 | Mukund Deshpande, Michihiro Kuramochi, George Karypis: Mining Chemical Compounds. Data Mining in Bioinformatics 2005: 189-215 | |
94 | EE | Huzefa Rangwala, George Karypis: Profile-based direct kernels for remote homology detection and fold recognition. Bioinformatics 21(23): 4239-4247 (2005) |
93 | EE | Ying Zhao, George Karypis, Usama M. Fayyad: Hierarchical Clustering Algorithms for Document Datasets. Data Min. Knowl. Discov. 10(2): 141-168 (2005) |
92 | EE | Masakazu Seno, George Karypis: Finding Frequent Patterns Using Length-Decreasing Support Constraints. Data Min. Knowl. Discov. 10(3): 197-228 (2005) |
91 | EE | Michihiro Kuramochi, George Karypis: Finding Frequent Patterns in a Large Sparse Graph*. Data Min. Knowl. Discov. 11(3): 243-271 (2005) |
90 | EE | Mukund Deshpande, Michihiro Kuramochi, Nikil Wale, George Karypis: Frequent Substructure-Based Approaches for Classifying Chemical Compounds. IEEE Trans. Knowl. Data Eng. 17(8): 1036-1050 (2005) |
89 | EE | Michihiro Kuramochi, George Karypis: Gene Classification Using Expression Profiles: A Feasibility Study. International Journal on Artificial Intelligence Tools 14(4): 641-660 (2005) |
88 | EE | Ying Zhao, George Karypis: Prediction of Contact Maps Using Support Vector Machines. International Journal on Artificial Intelligence Tools 14(5): 849-866 (2005) |
2004 | ||
87 | EE | Ying Zhao, George Karypis: Soft clustering criterion functions for partitional document clustering: a summary of results. CIKM 2004: 246-247 |
86 | EE | Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, George Karypis: Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources. DAC 2004: 741-746 |
85 | EE | Navaratnasothie Selvakkumaran, Abhishek Ranjan, Salil Raje, George Karypis: Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources. FPGA 2004: 253 |
84 | EE | Jianyong Wang, George Karypis: SUMMARY: Efficiently Summarizing Transactions for Clustering. ICDM 2004: 241-248 |
83 | EE | Michihiro Kuramochi, George Karypis: GREW-A Scalable Frequent Subgraph Discovery Algorithm. ICDM 2004: 439-442 |
82 | EE | Krishna Gade, Jianyong Wang, George Karypis: Efficient closed pattern mining in the presence of tough block constraints. KDD 2004: 138-147 |
81 | EE | Jianyong Wang, George Karypis: BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint. SDM 2004 |
80 | EE | Michihiro Kuramochi, George Karypis: Finding Frequent Patterns in a Large Sparse Graph. SDM 2004 |
79 | EE | Mukund Deshpande, George Karypis: Item-based top-N recommendation algorithms. ACM Trans. Inf. Syst. 22(1): 143-177 (2004) |
78 | EE | Mukund Deshpande, George Karypis: Selective Markov models for predicting Web page accesses. ACM Trans. Internet Techn. 4(2): 163-184 (2004) |
77 | EE | Michihiro Kuramochi, George Karypis: An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans. Knowl. Data Eng. 16(9): 1038-1051 (2004) |
76 | EE | Ying Zhao, George Karypis: Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Machine Learning 55(3): 311-331 (2004) |
75 | EE | Valerie Guralnik, George Karypis: Parallel tree-projection-based sequence mining algorithms. Parallel Computing 30(4): 443-472 (2004) |
2003 | ||
74 | EE | Ying Zhao, George Karypis: Prediction of Contact Maps Using Support Vector Machines. BIBE 2003: 26- |
73 | EE | Eui-Hong Han, George Karypis, Doug Mewhort, Keith Hatchard: Intelligent metasearch engine for knowledge management. CIKM 2003: 492-495 |
72 | EE | Navaratnasothie Selvakkumaran, George Karypis: Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. ICCAD 2003: 726-733 |
71 | EE | Mukund Deshpande, Michihiro Kuramochi, George Karypis: Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. ICDM 2003: 35-42 |
70 | EE | George Karypis: Multi-Constraint Mesh Partitioning for Contact/Impact Computations. SC 2003: 56 |
69 | EE | Navaratnasothie Selvakkumaran, Phiroze N. Parakh, George Karypis: Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement. SLIP 2003: 53-59 |
68 | EE | Daniel J. Challou, Maria L. Gini, Vipin Kumar, George Karypis: Predicting the Performance of Randomized Parallel Search: An Application to Robot Motion Planning. Journal of Intelligent and Robotic Systems 38(1): 31-53 (2003) |
2002 | ||
67 | EE | Mukund Deshpande, Michihiro Kuramochi, George Karypis: Automated Approaches for Classifying Structures. BIOKDD 2002: 11-18 |
66 | EE | Mukund Deshpande, George Karypis: Using conjunction of attribute values for classification. CIKM 2002: 356-364 |
65 | EE | Ying Zhao, George Karypis: Evaluation of hierarchical clustering algorithms for document datasets. CIKM 2002: 515-524 |
64 | EE | Cristinel Ababei, Navaratnasothie Selvakkumaran, Kia Bazargan, George Karypis: Multi-objective circuit partitioning for cutsize and path-based delay minimization. ICCAD 2002: 181-185 |
63 | EE | Michihiro Kuramochi, George Karypis: Discovering Frequent Geometric Subgraphs. ICDM 2002: 258-265 |
62 | EE | Masakazu Seno, George Karypis: SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint. ICDM 2002: 418-425 |
61 | EE | Ying Zhao, George Karypis: Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes. ITCC 2002: 16-21 |
60 | EE | Mukund Deshpande, George Karypis: Evaluation of Techniques for Classifying Biological Sequences. PAKDD 2002: 417-431 |
59 | EE | B. Uygar Oztekin, George Karypis, Vipin Kumar: Expert agreement and content based reranking in a meta search environment using Mearf. WWW 2002: 333-344 |
58 | Kirk Schloegel, George Karypis, Vipin Kumar: Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience 14(3): 219-240 (2002) | |
2001 | ||
57 | Michihiro Kuramochi, George Karypis: Gene Classification using Expression Profiles: A Feasibility Study. BIBE 2001: 191-200 | |
56 | EE | Valerie Guralnik, George Karypis: A scalable algorithm for clustering protein sequences. BIOKDD 2001: 73-80 |
55 | George Karypis: Evaluation of Item-Based Top-N Recommendation Algorithms. CIKM 2001: 247-254 | |
54 | EE | Kirk Schloegel, George Karypis, Vipin Kumar: Graph Partitioning for Dynamic, Adaptive and Multi-phase Scientific Simulations. CLUSTER 2001: 271-273 |
53 | EE | Valerie Guralnik, Nivea Garg, George Karypis: Parallel Tree Projection Algorithm for Sequence Mining. Euro-Par 2001: 310-320 |
52 | EE | Valerie Guralnik, George Karypis: A Scalable Algorithm for Clustering Sequential Data. ICDM 2001: 179-186 |
51 | EE | Michihiro Kuramochi, George Karypis: Frequent Subgraph Discovery. ICDM 2001: 313-320 |
50 | EE | Masakazu Seno, George Karypis: LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint. ICDM 2001: 505-512 |
49 | EE | Eui-Hong Han, George Karypis, Vipin Kumar: Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification. PAKDD 2001: 53-65 |
48 | EE | Irene Moulitsas, George Karypis: Multilevel algorithms for generating coarse grids for multigrid methods. SC 2001: 45 |
47 | EE | Badrul M. Sarwar, George Karypis, Joseph A. Konstan, John Riedl: Item-based collaborative filtering recommendation algorithms. WWW 2001: 285-295 |
46 | EE | Naren Ramakrishnan, Benjamin J. Keller, Batul J. Mirza, Ananth Grama, George Karypis: When being Weak is Brave: Privacy in Recommender Systems CoRR cs.CG/0105028: (2001) |
45 | EE | Naren Ramakrishnan, Benjamin J. Keller, Batul J. Mirza, Ananth Grama, George Karypis: Privacy Risks in Recommender Systems. IEEE Internet Computing 5(6): 54-62 (2001) |
44 | EE | Kirk Schloegel, George Karypis, Vipin Kumar: Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes. IEEE Trans. Parallel Distrib. Syst. 12(5): 451-466 (2001) |
2000 | ||
43 | EE | Badrul M. Sarwar, George Karypis, Joseph A. Konstan, John Riedl: Analysis of recommendation algorithms for e-commerce. ACM Conference on Electronic Commerce 2000: 158-167 |
42 | EE | Eui-Hong Han, George Karypis: Fast Supervised Dimensionality Reduction Algorithm with Applications to Document Categorization & Retrieval. CIKM 2000: 12-19 |
41 | EE | William Leinberger, George Karypis, Vipin Kumar: Memory Management Techniques for Gang Scheduling. Euro-Par 2000: 252-261 |
40 | EE | Kirk Schloegel, George Karypis, Vipin Kumar: Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning (Distinguished Paper). Euro-Par 2000: 296-310 |
39 | EE | William Leinberger, George Karypis, Vipin Kumar: Load Balancing Across Near-Homogeneous Multi-Resource Servers. Heterogeneous Computing Workshop 2000: 60-71 |
38 | EE | Vipin Kumar, Kirk Schloegel, George Karypis: Graph Partitioning for Dynamic, Adaptive, and Multi-phase Computations. IPDPS Workshops 2000: 476-476 |
37 | EE | Eui-Hong Han, George Karypis: Centroid-Based Document Classification: Analysis and Experimental Results. PKDD 2000: 424-431 |
36 | EE | Kirk Schloegel, George Karypis, Vipin Kumar: A Unified Algorithm for Load-balancing Adaptive Scientific Simulations. SC 2000 |
35 | EE | Eui-Hong Han, George Karypis, Vipin Kumar: Scalable Parallel Data Mining for Association Rules. IEEE Trans. Knowl. Data Eng. 12(3): 377-352 (2000) |
34 | Rupak Biswas, Bruce Hendrickson, George Karypis: Graph partitioning and parallel computing. Parallel Computing 26(12): 1515-1517 (2000) | |
1999 | ||
33 | EE | George Karypis, Vipin Kumar: Multilevel k-way Hypergraph Partitioning. DAC 1999: 343-348 |
32 | EE | Kirk Schloegel, George Karypis, Vipin Kumar: A New Algorithm for Multi-objective Graph Partitioning. Euro-Par 1999: 322-331 |
31 | EE | William Leinberger, George Karypis, Vipin Kumar: Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints. ICPP 1999: 404-412 |
30 | EE | Mahesh V. Joshi, Eui-Hong Han, George Karypis, Vipin Kumar: Efficient Parallel Algorithms for Mining Associations. Large-Scale Parallel Data Mining 1999: 83-126 |
29 | Kirk Schloegel, George Karypis, Vipin Kumar: Dynamic Repartitioning of Adaptively Refined Meshes. PPSC 1999 | |
28 | Mahesh V. Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred G. Gustavson: PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver. PPSC 1999 | |
27 | Daniel Boley, Maria L. Gini, Robert Gross, Eui-Hong Han, Kyle Hastings, George Karypis, Vipin Kumar, Bamshad Mobasher, Jerome Moore: Document Categorization and Query Generation on the World Wide Web Using WebACE. Artif. Intell. Rev. 13(5-6): 365-391 (1999) | |
26 | George Karypis, Eui-Hong Han, Vipin Kumar: Chameleon: Hierarchical Clustering Using Dynamic Modeling. IEEE Computer 32(8): 68-75 (1999) | |
25 | EE | George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. VLSI Syst. 7(1): 69-79 (1999) |
1998 | ||
24 | EE | Eui-Hong Han, Daniel Boley, Maria L. Gini, Robert Gross, Kyle Hastings, George Karypis, Vipin Kumar, Bamshad Mobasher, Jerome Moore: WebACE: A Web Agent for Document Categorization and Exploration. Agents 1998: 408-415 |
23 | EE | Mahesh V. Joshi, George Karypis, Vipin Kumar: ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets. IPPS/SPDP 1998: 573-579 |
22 | Kirk Schloegel, George Karypis, Vipin Kumar: Load Balancing of Dynamic and Adaptive Mesh-Based Computations. SRDS 1998: 311 | |
21 | EE | Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad Mobasher: Hypergraph Based Clustering in High-Dimensional Data Sets: A Summary of Results. IEEE Data Eng. Bull. 21(1): 15-22 (1998) |
20 | George Karypis, Vipin Kumar: A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering. J. Parallel Distrib. Comput. 48(1): 71-95 (1998) | |
19 | George Karypis, Vipin Kumar: Multilevel k-way Partitioning Scheme for Irregular Graphs. J. Parallel Distrib. Comput. 48(1): 96-129 (1998) | |
1997 | ||
18 | EE | George Karypis, Rajat Aggarwal, Vipin Kumar, Shashi Shekhar: Multilevel Hypergraph Partitioning: Application in VLSI Domain. DAC 1997: 526-529 |
17 | Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad Mobasher: Clustering Based On Association Rule Hypergraphs. DMKD 1997: 0- | |
16 | Kirk Schloegel, George Karypis, Vipin Kumar: Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion. Euro-Par 1997: 945-949 | |
15 | George Karypis, Vipin Kumar: A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm. PPSC 1997 | |
14 | Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, George Karypis, Vipin Kumar: Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems: Preliminary Results. PPSC 1997 | |
13 | Vipin Kumar, George Karypis, Ananth Grama: Role of Message-Passing in Performance Oriented Parallel Programming. PPSC 1997 | |
12 | EE | Eui-Hong Han, George Karypis, Vipin Kumar: Scalable Parallel Data Mining for Association Rules. SIGMOD Conference 1997: 277-288 |
11 | EE | Anshul Gupta, George Karypis, Vipin Kumar: Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. IEEE Trans. Parallel Distrib. Syst. 8(5): 502-520 (1997) |
10 | Kirk Schloegel, George Karypis, Vipin Kumar: Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes. J. Parallel Distrib. Comput. 47(2): 109-124 (1997) | |
1996 | ||
9 | EE | George Karypis, Vipin Kumar: Parallel Multilevel Graph Partitioning. IPPS 1996: 314-319 |
1995 | ||
8 | George Karypis, Vipin Kumar: Multilevel Graph Partitioning Schemes. ICPP (3) 1995: 113-122 | |
7 | George Karypis, Anshul Gupta, Vipin Kumar: A Highly Parallel Interior Point Algorithm. PPSC 1995: 110-112 | |
6 | EE | George Karypis, Vipin Kumar: Analysis of Multilevel Graph Partitioning. SC 1995 |
1994 | ||
5 | Vipin Kumar, Ananth Grama, Anshul Gupta, George Karypis: Introduction to Parallel Computing. Benjamin/Cummings 1994 | |
4 | EE | George Karypis, Anshul Gupta, Vipin Kumar: A parallel formulation of interior point algorithms. SC 1994: 204-213 |
3 | EE | George Karypis, Vipin Kumar: Unstructured Tree Search on SIMD Parallel Computers. IEEE Trans. Parallel Distrib. Syst. 5(10): 1057-1072 (1994) |
1993 | ||
2 | George Karypis, Vipin Kumar: Efficient Parallel Mappings of a Dynamic Programming Algorithm: A Summary of Results. IPPS 1993: 563-568 | |
1992 | ||
1 | George Karypis, Vipin Kumar: Unstructured Tree Search on SIMD Parallel Computers: A Summary of Results. SC 1992: 453-462 |