[Edit]

Jiawei Han [FOAF]  [Follow]

Position: Professor
Affiliation: Department of Computer Science Univ. of Illinois at Urbana-Champaign Rm 2132, Siebel Center for Computer Science
Address: 201 N. Goodwin Avenue Urbana, IL 61801, USA
Phone: (217) 333-6903
Fax: (217) 265-6494
Email:
Homepage: http://www-sal.cs.uiuc.edu/~hanj/
[Edit]

Statistics: H-index: 74 (See all experts' h-index.)
total citation number: 52292
highest-cited paper: Data Mining: Concepts and Techniques (2000) (Cited By 9913)

Research Interest:

Data Mining, Efficient Mining, Spatial Data Mining, Frequent Itemset Mining, Mining Frequent Patterns

Show Temporal Interests (Do you want to see the change of his/her research interests?)

Education: [Edit]

Phd University: Univ. Wisconsin-Madison Phd Major: Computer Science Phd Date: 1985

National Science Foundation - US

[7] SGER: CS-BibCube: OLAPing and Mining of Computer Science Literature (0842769), 2008-09-01 - 2010-02-28
[6] SGER: DataScope: Viewing Database Contents in Multi-Resolution at Your Finger Tips (0642771), 2006-09-01 - 2007-08-31
[5] Collaborative Research: Endowing Biological Databases With Analytical Power: Indexing, Querying, and Mining of Complex Biological Structures (0515813), 2005-09-15 - 2009-08-31
[4] SEI(IIS): MotionEye: Querying and Mining Large Datasets of Moving Objects (0513678), 2005-07-15 - 2008-06-30
[3] NGS: Collaborative Research: Reusable, Observation-based Performance Prediction across Platforms (0406408), 2004-08-01 - 2005-07-31

Publications: [Edit disambiguation Result]

2010(1)
[396]Hector GonzalezJiawei HanHong ChengXiaolei LiDiego KlabjanTianyi WuModeling Massive RFID Data Sets: A Gateway-Based Movement Graph Approach. IEEE Trans. Knowl. Data Eng., 2010: 90~104   [Bibtex]
2009(39)
[395]Xiao YuLu An TangJiawei HanFiltering and Refinement: A Two-Stage Approach for Efficient and Effective Anomaly Detection. 2009. pp.617~626   [Bibtex]
[394]Samson HauguelChengXiang ZhaiJiawei HanParallel PathFinder Algorithms for Mining Structures from Graphs. 2009. pp.812~817   [Bibtex]
[393]Yizhou SunJiawei HanJing GaoYintao YuiTopicModel: Information Network-Integrated Topic Modeling. 2009. pp.493~502   [Bibtex]
[392]Jie YuXin JinJiawei HanJiebo LuoMining Personal Image Collection for Social Group Suggestion. 2009. pp.202~207   [Bibtex]
[391]Jiawei HanMining Heterogeneous Information Networks by Exploring the Power of Links.  ALT'2009. pp.3~3    Cited By 43[Bibtex]
[390]Peixiang ZhaoJiawei HanYizhou SunP-Rank: a comprehensive structural similarity measure over information networks.  CIKM'2009. pp.553~562    Cited By 4[Bibtex]
[389]Mohammad Maifi Hasan KhanTarek F. AbdelzaherJiawei HanHossein AhmadiFinding Symbolic Bug Patterns in Sensor Networks.  DCOSS'2009. pp.131~144   [Bibtex]
[388]Jiawei HanMining Heterogeneous Information Networks by Exploring the Power of Links.  Discovery Science'2009. pp.13~30    Cited By 43[Bibtex]
[387]Tianyi WuJiawei HanSubspace Discovery for Promotion: A Cell Clustering Approach.  Discovery Science'2009. pp.362~376   [Bibtex]
[386]Min-Soo KimJiawei HanCHRONICLE: A Two-Stage Density-Based Clustering Algorithm for Dynamic Networks.  Discovery Science'2009. pp.152~167   [Bibtex]
[385]Jiawei HanXifeng YanPhilip S. YuScalable OLAP and mining of information networks.  EDBT'2009. pp.1159~1159    Cited By 1[Bibtex] [PDF]
[384]Yizhou SunJiawei HanPeixiang ZhaoZhijun YinHong ChengTianyi WuRankClus: integrating clustering with ranking for heterogeneous information network analysis.  EDBT'2009. pp.565~576    Cited By 13[Bibtex] [PDF]
[383]Bhavani M. ThuraisinghamLatifur KhanMurat KantarciogluSonia ChibJiawei HanSang SonReal-Time Knowledge Discovery and Dissemination for Intelligence Analysis.  HICSS'2009. pp.1~12   [Bibtex]
[382]Jing GaoGuofei JiangHaifeng ChenJiawei HanModeling Probabilistic Measurement Correlations for Problem Determination in Large-Scale Distributed Systems.  ICDCS'2009. pp.623~630   [Bibtex]
[381]Xiaolei LiZhenhui LiJiawei HanJae-Gil LeeTemporal Outlier Detection in Vehicle Traffic Data.  ICDE'2009. pp.1319~1322    Cited By 6[Bibtex] [PDF]
[380]Bolin DingDavid LoJiawei HanSiau-Cheng KhooEfficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database.  ICDE'2009. pp.1024~1035    Cited By 7[Bibtex] [PDF]
[379]Deng CaiXiaofei HeXuanhui WangHujun BaoJiawei HanLocality Preserving Nonnegative Matrix Factorization.  IJCAI'2009. pp.1010~1015    Cited By 3[Bibtex] [PDF]
[378]Zhijun YinRui LiQiaozhu MeiJiawei HanExploring social tagging graph for web object classification.  KDD'2009. pp.957~966    Cited By 5[Bibtex] [PDF]
[377]Yizhou SunYintao YuJiawei HanRanking-based clustering of heterogeneous information networks with star network schema.  KDD'2009. pp.797~806    Cited By 10[Bibtex] [PDF]
[376]David LoHong ChengJiawei HanSiau-Cheng KhooChengnian SunClassification of software behaviors for failure detection: a discriminative pattern mining approach.  KDD'2009. pp.557~566    Cited By 9[Bibtex] [PDF]
[375]Jing GaoWei FanYizhou SunJiawei HanHeterogeneous source consensus learning via decision propagation and negotiation.  KDD'2009. pp.339~348    Cited By 5[Bibtex] [PDF]
[374]Chandrasekar RamachandranRahul MalikXin JinJing GaoKlara NahrstedtJiawei HanVideoMule: a consensus learning approach to multi-label classification from noisy user-generated videos.  ACM Multimedia'2009. pp.721~724    Cited By 3[Bibtex]
[373]Mohammad M. MasudJing GaoLatifur KhanJiawei HanBhavani M. ThuraisinghamA Multi-partition Multi-chunk Ensemble Technique to Classify Concept-Drifting Data Streams.  PAKDD'2009. pp.363~375    Cited By 2[Bibtex] [PDF]
[372]Mohammad M. MasudJing GaoLatifur KhanJiawei HanBhavani M. ThuraisinghamIntegrating Novel Class Detection with Classification for Concept-Drifting Data Streams.  ECML/PKDD (2)'2009. pp.79~94    Cited By 3[Bibtex]
[371]Xin JinSangkyum KimJiawei HanLiangliang CaoZhijun YinGAD: General Activity Detection for Fast Clustering on Large Data.  SDM'2009. pp.2~13   [Bibtex]
[370]Marisa ThomaHong ChengArthur GrettonJiawei HanHans-Peter KriegelAlexander J. SmolaLe SongPhilip S. YuXifeng YanKarsten M. BorgwardtNear-optimal Supervised Feature Selection among Frequent Subgraphs.  SDM'2009. pp.1075~1086    Cited By 9[Bibtex]
[369]Duo ZhangChengXiang ZhaiJiawei HanTopic Cube: Topic Modeling for OLAP on Multidimensional Text Databases.  SDM'2009. pp.1123~1134    Cited By 8[Bibtex]
[368]Rahul MalikSangkyum KimXin JinChandrasekar RamachandranJiawei HanIndranil GuptaKlara NahrstedtMLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions.  SSDBM'2009. pp.167~184    Cited By 1[Bibtex]
[367]Hongyan LiuXiaoyu WangJun HeJiawei HanDong XinZheng ShaoTop-down mining of frequent closed patterns from very high dimensional data. Inf. Sci., 2009: 899~924    Cited By 2[Bibtex]
[366]Chen ChenXifeng YanFeida ZhuJiawei HanPhilip S. YuGraph OLAP: a multi-dimensional framework for graph data analysis. Knowl. Inf. Syst., 2009: 41~63    Cited By 1[Bibtex]
[365]Chen ChenCindy Xide LinMatt FredriksonMihai ChristodorescuXifeng YanJiawei HanMining Graph Patterns Efficiently via Randomized Summaries. PVLDB, 2009: 742~753    Cited By 5[Bibtex]
[364]Yintao YuCindy Xide LinYizhou SunChen ChenJiawei HanBinbin LiaoTianyi WuChengXiang ZhaiDuo ZhangBo ZhaoiNextCube: Information Network-Enhanced Text Cube. PVLDB, 2009: 1622~1625    Cited By 2[Bibtex]
[363]Tianyi WuDong XinQiaozhu MeiJiawei HanPromotion Analysis in Multi-Dimensional Space. PVLDB, 2009: 109~120    Cited By 5[Bibtex]
[362]Min-Soo KimJiawei HanA Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks. PVLDB, 2009: 622~633    Cited By 7[Bibtex] [PDF]
[361]Duo ZhangChengXiang ZhaiJiawei HanAshok SrivastavaNikunj C. OzaTopic modeling for OLAP on multidimensional text databases: topic cube and its applications. Statistical Analysis and Data Mining, 2009: 378~395   [Bibtex]
[360]Jiawei HanData Mining.  Theory of Computing Systems, 2009: 595~598    Cited By 43[Bibtex]
[359]Hong ChengJiawei HanFrequent Itemsets and Association Rules.  Theory of Computing Systems, 2009: 1184~1187   [Bibtex]
[358]Hong ChengJiawei HanPattern-Growth Methods.  Theory of Computing Systems, 2009: 2051~2054   [Bibtex]
[357]Jiawei HanBolin DingStream Mining.  Theory of Computing Systems, 2009: 2831~2834   [Bibtex]
2008(36)
[356]Deng CaiXiaofei HeJiawei HanSparse Projections over Graph.  AAAI'2008. pp.610~615    Cited By 1[Bibtex] [PDF]
[355]Deng CaiQiaozhu MeiJiawei HanChengxiang ZhaiModeling hidden topics on document manifold.  CIKM'2008. pp.911~920    Cited By 6[Bibtex] [PDF]
[354]Chen ChenCindy Xide LinXifeng YanJiawei HanOn effective presentation of graph patterns: a structural representative approach.  CIKM'2008. pp.299~308    Cited By 2[Bibtex] [PDF]
[353]Jiawei HanData mining for image/video processing: a promising research frontier.  CIVR'2008. pp.1~2    Cited By 43[Bibtex]
[352]Deng CaiXiaofei HeJiawei HanTraining Linear Discriminant Analysis in Linear Time.  ICDE'2008. pp.209~217    Cited By 2[Bibtex]
[351]Jae-Gil LeeJiawei HanXiaolei LiTrajectory Outlier Detection: A Partition-and-Detect Framework.  ICDE'2008. pp.140~149    Cited By 29[Bibtex]
[350]Hong ChengXifeng YanJiawei HanPhilip S. YuDirect Discriminative Pattern Mining for Effective Classification.  ICDE'2008. pp.169~178    Cited By 33[Bibtex]
[349]Dong XinJiawei HanP-Cube: Answering Preference Queries in Multi-Dimensional Space.  ICDE'2008. pp.1092~1100    Cited By 4[Bibtex]
[348]Luiz F. MendesBolin DingJiawei HanStream Sequential Pattern Mining with Precise Error Bounds.  ICDM'2008. pp.941~946    Cited By 4[Bibtex] [PDF]
[347]Deng CaiXiaofei HeXiaoyun WuJiawei HanNon-negative Matrix Factorization on Manifold.  ICDM'2008. pp.63~72    Cited By 13[Bibtex]
[346]Cindy Xide LinBolin DingJiawei HanFeida ZhuBo ZhaoText Cube: Computing IR Measures for Multidimensional Text Database Analysis.  ICDM'2008. pp.905~910    Cited By 10[Bibtex] [PDF]
[345]Chen ChenXifeng YanFeida ZhuJiawei HanPhilip S. YuGraph OLAP: Towards Online Analytical Processing on Graphs.  ICDM'2008. pp.103~112    Cited By 8[Bibtex] [PDF]
[344]Mohammad M. MasudJing GaoLatifur KhanJiawei HanBhavani M. ThuraisinghamA Practical Approach to Classify Evolving Data Streams: Training with Limited Amount of Labeled Data.  ICDM'2008. pp.929~934    Cited By 10[Bibtex] [PDF]
[343]Xiaoxin YinJiawei HanExploring the Power of Heuristics and Links in Multi-relational Data Mining.  ISMIS'2008. pp.17~27    Cited By 3[Bibtex]
[342]Jing GaoWei FanJing JiangJiawei HanKnowledge transfer via multiple model local structure mapping.  KDD'2008. pp.283~291    Cited By 15[Bibtex] [PDF]
[341]Bin JiangJian PeiXuemin LinDavid W. CheungJiawei HanMining preferences from superior and inferior examples.  KDD'2008. pp.390~398    Cited By 9[Bibtex] [PDF]
[340]Wei FanKun ZhangHong ChengJing GaoXifeng YanJiawei HanPhilip S. YuOlivier VerscheureDirect mining of discriminative and essential frequent patterns via model-based search tree.  KDD'2008. pp.230~238    Cited By 18[Bibtex] [PDF]
[339]Ding YuanKyuhyung LeeHong ChengGopal KrishnaZhenmin LiXiao MaYuanyuan ZhouJiawei HanCISpan: Comprehensive Incremental Mining Algorithms of Closed Sequential Patterns for Multi-Versional Software Mining.  SDM'2008. pp.84~95    Cited By 4[Bibtex]
[338]Sangkyum KimXin JinJiawei HanSpaRClus: Spatial Relationship Pattern-Based Hierarchial Clustering.  SDM'2008. pp.49~60   [Bibtex]
[337]Mohammad Maifi Hasan KhanHieu Khac LeHossein AhmadiTarek F. AbdelzaherJiawei HanDustminer: troubleshooting interactive complexity bugs in sensor networks.  SenSys'2008. pp.99~112    Cited By 21[Bibtex] [PDF]
[336]Tianyi WuDong XinJiawei HanARCube: supporting ranking aggregate queries in partially materialized data cubes.  SIGMOD Conference'2008. pp.79~92    Cited By 8[Bibtex] [PDF]
[335]Yizhou SunTianyi WuZhijun YinHong ChengJiawei HanXiaoxin YinPeixiang ZhaoBibNetMiner: mining bibliographic information networks.  SIGMOD Conference'2008. pp.1341~1344    Cited By 1[Bibtex]
[334]Xifeng YanHong ChengJiawei HanPhilip S. YuMining significant graph patterns by leap search.  SIGMOD Conference'2008. pp.433~444    Cited By 49[Bibtex]
[333]Xiaolei LiJiawei HanZhijun YinJae-Gil LeeYizhou SunSampling cube: a framework for statistical olap over sampling data.  SIGMOD Conference'2008. pp.779~790    Cited By 3[Bibtex] [PDF]
[332]Sangkyum KimJaebum KimYounhee KoSeung-won HwangJiawei HanPerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes.  WAIM'2008. pp.270~277   [Bibtex]
[331]Jing GaoBolin DingWei FanJiawei HanPhilip S. YuClassifying Data Streams with Skewed Class Distributions and Concept Drifts. IEEE Internet Computing, 2008: 37~49    Cited By 2[Bibtex]
[330]Xu LingXin HeDong XinJiawei HanEfficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison. Journal of Computational Biology, 2008: 593~609    Cited By 5[Bibtex]
[329]Ok-Ran JeongJiawei HanWon KimEunseok LeeOn Having Search Engines Deliver Hierarchies of Web Pages. Journal of Object Technology, 2008: 33~41   [Bibtex]
[328]Xiaoxin YinJiawei HanPhilip S. YuTruth Discovery with Multiple Conflicting Information Providers on the Web. IEEE Trans. Knowl. Data Eng., 2008: 796~808    Cited By 34[Bibtex] [PDF]
[327]Xiaofei HeDeng CaiJiawei HanLearning a Maximum Margin Subspace for Image Retrieval. IEEE Trans. Knowl. Data Eng., 2008: 189~201    Cited By 35[Bibtex]
[326]Deng CaiXiaofei HeJiawei HanSRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis. IEEE Trans. Knowl. Data Eng., 2008: 1~12    Cited By 46[Bibtex]
[325]Chao LiuXiangyu ZhangJiawei HanA Systematic Study of Failure Proximity. IEEE Trans. Software Eng., 2008: 826~843    Cited By 1[Bibtex]
[324]Jae-Gil LeeJiawei HanXiaolei LiHector GonzalezTraClass: trajectory classification using hierarchical region-based and trajectory-based clustering. PVLDB, 2008: 1081~1094    Cited By 20[Bibtex] [PDF]
[323]Jiawei HanOLAP, Spatial.  Encyclopedia of GIS, 2008: 809~812    Cited By 43[Bibtex]
[322]Xiaolei LiJiawei HanSangkyum KimHector GonzalezAnomaly Detection in Moving Object.  Intelligence and Security Informatics, 2008: 357~381    Cited By 1[Bibtex]
[321]Hong ChengPhilip S. YuJiawei HanApproximate Frequent Itemset Mining In the Presence of Random Noise.  Soft Computing for Knowledge Discovery and Data Mining, 2008: 363~389    Cited By 7[Bibtex]
2007(46)
[320]Deng CaiXiaofei HeJiawei HanIsometric Projection.  AAAI'2007. pp.528~533    Cited By 12[Bibtex]
[319]Deng CaiXiaofei HeWei Vivian ZhangJiawei HanRegularized locality preserving indexing via spectral regression.  CIKM'2007. pp.741~750    Cited By 14[Bibtex]
[318]Deng CaiXiaofei HeYuxiao HuJiawei HanThomas S. HuangLearning a Spatially Smooth Subspace for Face Recognition.  CVPR'2007.    [Bibtex]
[317]Deng CaiXiaofei HeJiawei HanSpectral Regression for Efficient Regularized Subspace Learning.  ICCV'2007. pp.1~8    Cited By 44[Bibtex]
[316]Deng CaiXiaofei HeJiawei HanSemi-supervised Discriminant Analysis.  ICCV'2007. pp.1~7    Cited By 72[Bibtex]
[315]Hong ChengXifeng YanJiawei HanChih-Wei HsuDiscriminative Frequent Pattern Analysis for Effective Classification.  ICDE'2007. pp.716~725   [Bibtex]
[314]Hector GonzalezJiawei HanXuehua ShenCost-Conscious Cleaning of Massive RFID Data Sets.  ICDE'2007. pp.1268~1272    Cited By 17[Bibtex]
[313]Wen JinMartin EsterZengjian HuJiawei HanThe Multi-Relational Skyline Operator.  ICDE'2007. pp.1276~1280    Cited By 10[Bibtex]
[312]Xiaoxin YinJiawei HanPhilip S. YuObject Distinction: Distinguishing Objects with Identical Names.  ICDE'2007. pp.1242~1246    Cited By 22[Bibtex]
[311]Feida ZhuXifeng YanJiawei HanPhilip S. YuHong ChengMining Colossal Frequent Patterns by Core Pattern Fusion.  ICDE'2007. pp.706~715    Cited By 21[Bibtex]
[310]Dong XinJiawei HanIntegrating OLAP and Ranking: The Ranking-Cube Methodology.  ICDE Workshops'2007. pp.253~256   [Bibtex]
[309]Deng CaiXiaofei HeJiawei HanEfficient Kernel Discriminant Analysis via Spectral Regression.  ICDM'2007. pp.427~432    Cited By 24[Bibtex]
[308]Jing GaoWei FanJiawei HanOn Appropriate Assumptions to Mine Data Streams: Analysis and Practice.  ICDM'2007. pp.143~152    Cited By 21[Bibtex]
[307]Feida ZhuXifeng YanJiawei HanPhilip S. YuEfficient Discovery of Frequent Approximate Sequential Patterns.  ICDM'2007. pp.751~756    Cited By 3[Bibtex]
[306]Deng CaiXiaofei HeJiawei HanSpectral Regression: A Unified Approach for Sparse Subspace Learning.  ICDM'2007. pp.73~82    Cited By 9[Bibtex]
[305]Chen ChenXifeng YanFeida ZhuJiawei HangApprox: Mining Frequent Approximate Patterns from a Massive Network.  ICDM'2007. pp.445~450    Cited By 10[Bibtex]
[304]Xiangyu Zhang Chao LiuYu ZhangJiawei HanBharat K. BhargavaIndexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach.  ICSM'2007. pp.455~464   [Bibtex]
[303]Deng CaiXiaofei HeKun ZhouJiawei HanHujun BaoLocality Sensitive Discriminant Analysis.  IJCAI'2007. pp.708~713    Cited By 45[Bibtex] [PDF]
[302]Xiaoxin YinJiawei HanPhilip S. YuTruth discovery with multiple conflicting information providers on the web.  KDD'2007. pp.1048~1052    Cited By 34[Bibtex] [PDF]
[301]Deng CaiXiaofei HeJiawei HanRegularized regression on image manifold for retrieval.  Multimedia Information Retrieval'2007. pp.11~20    Cited By 3[Bibtex]
[300]Deng CaiXiaofei HeJiawei HanSpectral regression: a unified subspace learning framework for content-based image retrieval.  ACM Multimedia'2007. pp.403~412    Cited By 19[Bibtex]
[299]Feida ZhuXifeng YanJiawei HanPhilip S. YugPrune: A Constraint Pushing Framework for Graph Pattern Mining.  PAKDD'2007. pp.388~400    Cited By 21[Bibtex]
[298]Jiawei HanResearch Frontiers in Advanced Data Mining Technologies and Applications.  PAKDD'2007. pp.1~5    Cited By 43[Bibtex]
[297]Tianyi WuYuguo ChenJiawei HanAssociation Mining in Large Databases: A Re-examination of Its Measures.  PKDD'2007. pp.621~628    Cited By 17[Bibtex]
[296]Jing GaoWei FanJiawei HanPhilip S. YuA General Framework for Mining Concept-Drifting Data Streams with Skewed Distributions.  SDM'2007.     Cited By 24[Bibtex]
[295]Xiaolei LiJiawei HanSangkyum KimHector GonzalezROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets.  SDM'2007.     Cited By 19[Bibtex]
[294]Dong XinJiawei HanKevin Chen-Chuan ChangProgressive and selective merge: computing top-k with ad-hoc ranking functions.  SIGMOD Conference'2007. pp.103~114    Cited By 35[Bibtex]
[293]Jae-Gil LeeJiawei HanKyu-Young WhangTrajectory clustering: a partition-and-group framework.  SIGMOD Conference'2007. pp.593~604    Cited By 101[Bibtex]
[292]Xiaoyu WangHongyan LiuJiawei HanFinding frequent items in data streams using hierarchical information.  SMC'2007. pp.431~436    Cited By 8[Bibtex]
[291]Xiaolei LiJiawei HanJae-Gil LeeHector GonzalezTraffic Density-Based Discovery of Hot Routes in Road Networks.  SSTD'2007. pp.441~459    Cited By 26[Bibtex]
[290]Wen JinAnthony K. H. TungMartin EsterJiawei HanOn Efficient Processing of Subspace Skyline Queries on High Dimensional Data.  SSDBM'2007. pp.12~12    Cited By 7[Bibtex]
[289]Xiaolei LiJiawei HanMining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data.  VLDB'2007. pp.447~458    Cited By 11[Bibtex]
[288]Tianyi WuXiaolei LiDong XinJiawei HanJacob LeeRicardo RedderDataScope: Viewing Database Contents in Google Maps' Way.  VLDB'2007. pp.1314~1317    Cited By 8[Bibtex]
[287]Chen ChenXifeng YanPhilip S. YuJiawei HanDong-Qing ZhangXiaohui GuTowards Graph Containment Search and Indexing.  VLDB'2007. pp.926~937    Cited By 24[Bibtex]
[286]Hector GonzalezJiawei HanXiaolei LiMargaret MyslinskaJohn Paul SondagAdaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach.  VLDB'2007. pp.794~805    Cited By 20[Bibtex]
[285]Jiawei HanExploring the Power of Links in Data Mining.  APWeb/WAIM'2007. pp.2~2    Cited By 43[Bibtex]
[284]Jiawei HanMining, Indexing, and Searching Graphs in Large Data Sets.  MLG'2007.     Cited By 43[Bibtex]
[283]Chulyun KimSangkyum KimRussell DorerDan XieJiawei HanSheng ZhongTagSmart: analysis and visualization for yeast mutant fitness data measured by tag microarrays. BMC Bioinformatics, 2007.    [Bibtex]
[282]Jiawei HanHong ChengDong XinXifeng YanFrequent pattern mining: current status and future directions. Data Min. Knowl. Discov., 2007: 55~86    Cited By 151[Bibtex]
[281]Xiaoxin YinJiawei HanPhilip S. YuCrossClus: user-guided multi-relational clustering. Data Min. Knowl. Discov., 2007: 321~348    Cited By 11[Bibtex]
[280]Dong XinJiawei HanXifeng YanHong ChengOn compressing frequent patterns. Data Knowl. Eng., 2007: 5~29    Cited By 16[Bibtex]
[279]Jian PeiJiawei HanWei WangConstraint-based sequential pattern mining: the pattern-growth methods. J. Intell. Inf. Syst., 2007: 133~160    Cited By 14[Bibtex]
[278]Dong XinJiawei HanXiaolei LiZheng ShaoBenjamin W. WahComputing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach. IEEE Trans. Knowl. Data Eng., 2007: 111~126    Cited By 12[Bibtex]
[277]Jianyong WangJiawei HanChun LiFrequent Closed Sequence Mining without Candidate Maintenance. IEEE Trans. Knowl. Data Eng., 2007: 1042~1056    Cited By 29[Bibtex]
[276]Jiawei HanIntroduction. TKDD, 2007.     Cited By 43[Bibtex] [PDF]
[275]Qiaozhu MeiDong XinHong ChengJiawei HanChengxiang ZhaiSemantic annotation of frequent patterns. TKDD, 2007.     Cited By 5[Bibtex]
2006(34)
[274]Jiawei HanHector GonzalezXiaolei LiDiego KlabjanWarehousing and Mining Massive RFID Data Sets.  ADMA'2006. pp.1~18    Cited By 16[Bibtex] [PDF]
[273]Hector GonzalezJiawei HanXiaolei LiMining compressed commodity workflows from massive RFID data sets.  CIKM'2006. pp.162~171    Cited By 31[Bibtex] [PDF]
[272]Charu C. AggarwalChen ChenJiawei HanOn the Inverse Classification Problem and its Applications.  ICDE'2006. pp.111~111   [Bibtex] [PDF]
[271]Hector GonzalezJiawei HanXiaolei LiDiego KlabjanWarehousing and Analyzing Massive RFID Data Sets.  ICDE'2006. pp.83~83    Cited By 120[Bibtex] [PDF]
[270]Jiawei HanXifeng YanPhilip S. YuMining, Indexing, and Similarity Search in Graphs and Complex Structures.  ICDE'2006. pp.106~106    Cited By 1[Bibtex] [PDF]
[269]Hongyan LiuJiawei HanDong XinZheng ShaoTop-Down Mining of Interesting Patterns from Very High Dimensional Data.  ICDE'2006. pp.114~114    Cited By 9[Bibtex] [PDF]
[268]Dong XinZheng ShaoJiawei HanHongyan LiuC-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking.  ICDE'2006. pp.4~4    Cited By 30[Bibtex] [PDF]
[267]Xifeng YanFeida ZhuJiawei HanPhilip S. YuSearching Substructures with Superimposed Distance.  ICDE'2006. pp.88~88    Cited By 24[Bibtex]
[266]Hong ChengPhilip S. YuJiawei HanAC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery.  ICDM'2006. pp.839~844    Cited By 20[Bibtex] [PDF]
[265]Chao LiuZeng LianJiawei HanHow Bayesians Debug.  ICDM'2006. pp.382~393    Cited By 8[Bibtex] [PDF]
[264]Xiaolei LiJiawei HanSangkyum KimMotion-Alert: Automatic Anomaly Detection in Massive Moving Objects.  ISI'2006. pp.166~177    Cited By 15[Bibtex] [PDF]
[263]Chao LiuChen ChenJiawei HanPhilip S. YuGPLAG: detection of software plagiarism by program dependence graph analysis.  KDD'2006. pp.872~881    Cited By 54[Bibtex] [PDF]
[262]Qiaozhu MeiDong XinHong ChengJiawei HanChengXiang ZhaiGenerating semantic annotations for frequent patterns with context analysis.  KDD'2006. pp.337~346    Cited By 22[Bibtex] [PDF]
[261]Dong XinHong ChengXifeng YanJiawei HanExtracting redundancy-aware top-k patterns.  KDD'2006. pp.444~453    Cited By 37[Bibtex] [PDF]
[260]Dong XinXuehua ShenQiaozhu MeiJiawei HanDiscovering interesting patterns through user's interactive feedback.  KDD'2006. pp.773~778    Cited By 19[Bibtex]
[259]Wen JinAnthony K. H. TungJiawei HanWei WangRanking Outliers Using Symmetric Neighborhood Relationship.  PAKDD'2006. pp.577~593    Cited By 33[Bibtex] [PDF]
[258]Hongyan LiuJiawei HanDong XinZheng ShaoMining Interesting Patterns from Very High Dimensional Data: A Top-Down Row Enumeration Approach.  SDM'2006.     Cited By 5[Bibtex]
[257]Chao LiuXifeng YanJiawei HanMining Control Flow Abnormality for Logic Error Isolation.  SDM'2006.     Cited By 18[Bibtex]
[256]Deng CaiXiaofei HeJiawei HanTensor space model for document analysis.  SIGIR'2006. pp.625~626    Cited By 11[Bibtex]
[255]Kaushik ChakrabartiVenkatesh GantiJiawei HanDong XinRanking objects based on relationships.  SIGMOD Conference'2006. pp.371~382    Cited By 27[Bibtex]
[254]Chao LiuJiawei HanFailure proximity: a fault localization-based approach.  SIGSOFT FSE'2006. pp.46~56    Cited By 32[Bibtex]
[253]Hector GonzalezJiawei HanXiaolei LiFlowCube: Constructuing RFID FlowCubes for Multi-Dimensional Analysis of Commodity Flows.  VLDB'2006. pp.834~845   [Bibtex]
[252]Dong XinChen ChenJiawei HanTowards Robust Indexing for Ranked Queries.  VLDB'2006. pp.235~246    Cited By 14[Bibtex]
[251]Dong XinJiawei HanHong ChengXiaolei LiAnswering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach.  VLDB'2006. pp.463~475    Cited By 29[Bibtex]
[250]Xiaoxin YinJiawei HanPhilip S. YuLinkClus: Efficient Clustering via Heterogeneous Semantic Links.  VLDB'2006. pp.427~438    Cited By 44[Bibtex]
[249]Hongyan LiuYing LuJiawei HanJun HeError-Adaptive and Time-Aware Maintenance of Frequency Counts over Data Streams.  WAIM'2006. pp.484~495    Cited By 7[Bibtex]
[248]Fei PanKiran KamathKangyu ZhangSudip PulapuraAvinash AcharJuan Nunez-IglesiasYu HuangXifeng YanJiawei HanHaiyan HuMin XuJianjun HuXianghong Jasmine ZhouIntegrative Array Analyzer: a software package for analysis of cross-platform and cross-species microarray data. Bioinformatics, 2006: 1665~1667    Cited By 8[Bibtex]
[247]Jian PeiJiawei HanLaks V. S. LakshmananAn Erratum on 'Pushing Convertible Constraints in Frequent Itemset Mining. Data Min. Knowl. Discov., 2006: 119~119    Cited By 33[Bibtex]
[246]Charu C. AggarwalJiawei HanJianyong WangPhilip S. YuA Framework for On-Demand Classification of Evolving Data Streams. IEEE Trans. Knowl. Data Eng., 2006: 577~589    Cited By 20[Bibtex]
[245]Yixin ChenGuozhu DongJiawei HanJian PeiBenjamin W. WahJianyong WangRegression Cubes with Lossless Compression and Aggregation. IEEE Trans. Knowl. Data Eng., 2006: 1585~1599    Cited By 18[Bibtex]
[244]Jianyong WangJiawei HanJian PeiClosed Constrained Gradient Mining in Retail Databases. IEEE Trans. Knowl. Data Eng., 2006: 764~769    Cited By 5[Bibtex]
[243]Xiaoxin YinJiawei HanJiong YangPhilip S. YuEfficient Classification across Multiple Database Relations: A CrossMine Approach. IEEE Trans. Knowl. Data Eng., 2006: 770~783    Cited By 18[Bibtex]
[242]Xifeng YanFeida ZhuPhilip S. YuJiawei HanFeature-based similarity search in graph structures. ACM Trans. Database Syst., 2006: 1418~1453    Cited By 12[Bibtex]
[241]Chao LiuLong FeiXifeng YanJiawei HanSamuel P. MidkiffStatistical Debugging: A Hypothesis Testing-Based Approach. IEEE Trans. Software Eng., 2006: 831~848    Cited By 45[Bibtex]
2005(30)
[240]Haixun WangPhilip S. YuJiawei HanMining Data Streams.  The Data Mining and Knowledge Discovery Handbook, 2005: 777~792   [Bibtex] [PDF]
[239]Peter BajcsyJiawei HanLei LiuJiong YangSurvey of Biodata Analysis from a Data Mining Perspective.  Data Mining in Bioinformatics, 2005: 9~39    Cited By 11[Bibtex] [PDF]
[238]Xiaolei LiJiawei HanXiaoxin YinDong XinMining Evolving Customer-Product Relationships in Multi-Dimensional Space.  ICDE'2005. pp.580~581   [Bibtex] [PDF]
[237]Xifeng YanXianghong Jasmine ZhouJiawei HanMining Closed Relational Graphs with Connectivity Constraints.  ICDE'2005. pp.357~358    Cited By 49[Bibtex] [PDF]
[236]Haiyan HuXifeng YanYu HuangJiawei HanXianghong Jasmine ZhouMining coherent dense subgraphs across massive biological networks for functional discovery.  ISMB (Supplement of Bioinformatics)'2005. pp.213~221    Cited By 107[Bibtex]
[235]Shengnan CongJiawei HanDavid A. PaduaParallel mining of closed sequential patterns.  KDD'2005. pp.562~567    Cited By 36[Bibtex] [PDF]
[234]Xifeng YanHong ChengJiawei HanDong XinSummarizing itemset patterns: a profile-based approach.  KDD'2005. pp.314~323    Cited By 89[Bibtex] [PDF]
[233]Xifeng YanXianghong Jasmine ZhouJiawei HanMining closed relational graphs with connectivity constraints.  KDD'2005. pp.324~333    Cited By 49[Bibtex] [PDF]
[232]Xiaoxin YinJiawei HanPhilip S. YuCross-relational clustering with user's guidance.  KDD'2005. pp.344~353    Cited By 26[Bibtex]
[231]Xiaofei HeDeng CaiHaifeng LiuJiawei HanImage clustering with tensor representation.  ACM Multimedia'2005. pp.132~140    Cited By 16[Bibtex] [PDF]
[230]Deng CaiZheng ShaoXiaofei HeXifeng YanJiawei HanCommunity Mining from Multi-relational Networks.  PKDD'2005. pp.445~452    Cited By 37[Bibtex] [PDF]
[229]Wen JinMartin EsterJiawei HanEfficient Processing of Ranked Queries with Sweeping Selection.  PKDD'2005. pp.527~535    Cited By 6[Bibtex] [PDF]
[228]Xiaoxin YinJiawei HanEfficient Classification from Multiple Heterogeneous Databases.  PKDD'2005. pp.404~416    Cited By 5[Bibtex] [PDF]
[227]Shengnan CongJiawei HanJay HoeflingerDavid A. PaduaA sampling-based framework for parallel data mining.  PPOPP'2005. pp.255~265    Cited By 17[Bibtex]
[226]Hong ChengXifeng YanJiawei HanSeqIndex: Indexing Sequences by Sequential Pattern Analysis.  SDM'2005.     Cited By 7[Bibtex]
[225]Chao LiuXifeng YanHwanjo YuJiawei HanPhilip S. YuMining Behavior Graphs for 'Backtrace' of Noncrashing Bugs.  SDM'2005.    [Bibtex]
[224]Wei WangChen WangYongtai ZhuBaile ShiJian PeiXifeng YanJiawei HanGraphMiner: a structural pattern-mining system for large disk-based graph databases and its applications.  SIGMOD Conference'2005. pp.879~881    Cited By 11[Bibtex]
[223]Xifeng YanPhilip S. YuJiawei HanSubstructure Similarity Search in Graph Databases.  SIGMOD Conference'2005. pp.766~777    Cited By 99[Bibtex]
[222]Chao LiuXifeng YanLong FeiJiawei HanSamuel P. MidkiffSOBER: statistical model-based bug localization.  ESEC/SIGSOFT FSE'2005. pp.286~295    Cited By 117[Bibtex]
[221]Xiaoxin YinJiawei HanJiong YangSearching for Related Objects in Relational Databases.  SSDBM'2005. pp.227~236    Cited By 7[Bibtex]
[220]Dong XinJiawei HanXifeng YanHong ChengMining Compressed Frequent-Pattern Sets.  VLDB'2005. pp.709~720    Cited By 105[Bibtex]
[219]Charu C. AggarwalJiawei HanJianyong WangPhilip S. YuOn High Dimensional Projected Clustering of Data Streams. Data Min. Knowl. Discov., 2005: 251~273    Cited By 15[Bibtex]
[218]Hwanjo YuJiong YangJiawei HanXiaolei LiMaking SVMs Scalable to Large Data Sets using Hierarchical Cluster Indexing. Data Min. Knowl. Discov., 2005: 295~321    Cited By 18[Bibtex]
[217]Jiawei HanYixin ChenGuozhu DongJian PeiBenjamin W. WahJianyong WangY. Dora CaiStream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams. Distributed and Parallel Databases, 2005: 173~197    Cited By 59[Bibtex]
[216]Petre TzvetkovXifeng YanJiawei HanTSP: Mining top-k closed sequential patterns. Knowl. Inf. Syst., 2005: 438~457    Cited By 110[Bibtex] [PDF]
[215]Michael J. CareyJiawei HanA tribute to Professor Hongjun Lu. SIGMOD Record, 2005: 5~5   [Bibtex]
[214]Deng CaiXiaofei HeJiawei HanDocument Clustering Using Locality Preserving Indexing. IEEE Trans. Knowl. Data Eng., 2005: 1624~1637    Cited By 68[Bibtex]
[213]Jianyong WangJiawei HanYing LuPetre TzvetkovTFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Trans. Knowl. Data Eng., 2005: 652~664    Cited By 58[Bibtex]
[212]Ke WangYuelong JiangJeffrey Xu YuGuozhu DongJiawei HanDivide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining. IEEE Trans. Knowl. Data Eng., 2005: 354~368    Cited By 13[Bibtex]
[211]Xifeng YanPhilip S. YuJiawei HanGraph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst., 2005: 960~993    Cited By 37[Bibtex]
2004(26)
[210]Xiaoxin YinJiawei HanJiong YangPhilip S. YuCrossMine: Efficient Classification Across Multiple Database Relations.  Constraint-Based Mining and Inductive Databases'2004. pp.172~195    Cited By 78[Bibtex] [PDF]
[209]Bin HeKevin Chen-Chuan ChangJiawei HanMining complex matchings across Web query interfaces.  DMKD'2004. pp.3~10    Cited By 8[Bibtex] [PDF]
[208]Jianyong WangJiawei HanBIDE: Efficient Mining of Frequent Closed Sequences.  ICDE'2004. pp.79~90    Cited By 258[Bibtex] [PDF]
[207]Xiaoxin YinJiawei HanJiong YangPhilip S. YuCrossMine: Efficient Classification Across Multiple Database Relations.  ICDE'2004. pp.399~411    Cited By 78[Bibtex] [PDF]
[206]Hwanjo YuDuane SearsmithXiaolei LiJiawei HanScalable Construction of Topic Directory with Nonparametric Closed Termset Mining.  ICDM'2004. pp.563~566    Cited By 10[Bibtex] [PDF]
[205]Charu C. AggarwalJiawei HanJianyong WangPhilip S. YuOn demand classification of data streams.  KDD'2004. pp.503~508    Cited By 124[Bibtex]
[204]Hong ChengXifeng YanJiawei HanIncSpan: incremental mining of sequential patterns in large database.  KDD'2004. pp.527~532    Cited By 90[Bibtex] [PDF]
[203]Bin HeKevin Chen-Chuan ChangJiawei HanDiscovering complex matchings across web query interfaces: a correlation mining approach.  KDD'2004. pp.148~157    Cited By 132[Bibtex] [PDF]
[202]Yifan LiJiawei HanJiong YangClustering moving objects.  KDD'2004. pp.617~622    Cited By 92[Bibtex] [PDF]
[201]Andrew Y. WuMichael GarlandJiawei HanMining scale-free networks using geodesic clustering.  KDD'2004. pp.719~724    Cited By 47[Bibtex] [PDF]
[200]Won-Young KimYoung-Koo LeeJiawei HanCCMine: Efficient Mining of Confidence-Closed Correlated Patterns.  PAKDD'2004. pp.569~579    Cited By 19[Bibtex] [PDF]
[199]Wen JinJiawei HanMartin EsterMining Thick Skylines over Large Databases.  PKDD'2004. pp.255~266    Cited By 36[Bibtex] [PDF]
[198]Y. Dora CaiDavid ClutterGreg PapeJiawei HanMichael WelgeLoretta AuvilMAIDS: Mining Alarming Incidents from Data Streams.  SIGMOD Conference'2004. pp.919~920    Cited By 59[Bibtex]
[197]Xifeng YanPhilip S. YuJiawei HanGraph Indexing: A Frequent Structure-based Approach.  SIGMOD Conference'2004. pp.335~346    Cited By 197[Bibtex] [PDF]
[196]Yifan LiJiong YangJiawei HanContinuous K-Nearest Neighbor Search for Moving Objects.  SSDBM'2004. pp.123~126    Cited By 17[Bibtex] [PDF]
[195]Zheng ShaoJiawei HanDong XinMM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice Space.  SSDBM'2004. pp.213~222    Cited By 26[Bibtex] [PDF]
[194]Charu C. AggarwalJiawei HanJianyong WangPhilip S. YuA Framework for Projected Clustering of High Dimensional Data Streams.  VLDB'2004. pp.852~863    Cited By 178[Bibtex] [PDF]
[193]Xiaolei LiJiawei HanHector GonzalezHigh-Dimensional OLAP: A Minimal Cubing Approach.  VLDB'2004. pp.528~539    Cited By 64[Bibtex]
[192]Jian PeiJiawei HanLaks V. S. LakshmananPushing Convertible Constraints in Frequent Itemset Mining. Data Min. Knowl. Discov., 2004: 227~252    Cited By 33[Bibtex]
[191]Jiawei HanJian PeiYiwen YinRunying MaoMining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min. Knowl. Discov., 2004: 53~87    Cited By 3565[Bibtex]
[190]Jiawei HanJian PeiXifeng YanFrom Sequential Pattern Mining to Structured Pattern Mining: A Pattern-Growth Approach. J. Comput. Sci. Technol., 2004: 257~279    Cited By 16[Bibtex]
[189]Jian PeiGuozhu DongWei ZouJiawei HanMining Condensed Frequent-Pattern Bases. Knowl. Inf. Syst., 2004: 570~594    Cited By 29[Bibtex]
[188]K. P. UnnikrishnanRamasamy UthurusamyJiawei HanThe third SIGKDD workshop on mining temporal and sequential data (KDD/TDM 2004). SIGKDD Explorations, 2004: 152~152    Cited By 1[Bibtex]
[187]Guozhu DongJiawei HanJoyce M. W. LamJian PeiKe WangWei ZouMining Constrained Gradients in Large Databases. IEEE Trans. Knowl. Data Eng., 2004: 922~938    Cited By 15[Bibtex]
[186]Jian PeiJiawei HanBehzad Mortazavi-AslJianyong WangHelen PintoQiming ChenUmeshwar DayalMeichun HsuMining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Trans. Knowl. Data Eng., 2004: 1424~1440   [Bibtex] [PDF]
[185]Hwanjo YuJiawei HanKevin Chen-Chuan ChangPEBL: Web Page Classification without Negative Examples. IEEE Trans. Knowl. Data Eng., 2004: 70~81    Cited By 95[Bibtex] [PDF]
2003(19)
[184]Hwanjo YuChengXiang ZhaiJiawei HanText classification from positive and unlabeled documents.  CIKM'2003. pp.232~239    Cited By 34[Bibtex] [PDF]
[183]Hwanjo YuJiong YangWei WangJiawei HanDiscovering Compact and Highly Discriminative Features or Feature Combinations of Drug Activities Using Support Vector Machines.  CSB'2003. pp.220~228    Cited By 26[Bibtex] [PDF]
[182]Su-Jeong KoJiawei HanMining Typical Preferences of Collaborative User Groups.  ER'2003. pp.419~432    Cited By 1[Bibtex]
[181]Ke WangYuelong JiangJeffrey Xu YuGuozhu DongJiawei HanPushing Aggregate Constraints by Divide-and-Approximate.  ICDE'2003. pp.291~302    Cited By 10[Bibtex] [PDF]
[180]Young-Koo LeeWon-Young KimY. Dora CaiJiawei HanCoMine: Efficient Mining of Correlated Patterns.  ICDM'2003. pp.581~584    Cited By 34[Bibtex] [PDF]
[179]Petre TzvetkovXifeng YanJiawei HanTSP: Mining Top-K Closed Sequential Patterns.  ICDM'2003. pp.347~354    Cited By 110[Bibtex] [PDF]
[178]AnHai DoanYing LuYoonkyong LeeJiawei HanObject Matching for Information Integration: A Profiler-Based Approach.  IIWeb'2003. pp.53~58    Cited By 38[Bibtex] [PDF]
[177]Haixun WangWei FanPhilip S. YuJiawei HanMining concept-drifting data streams using ensemble classifiers.  KDD'2003. pp.226~235    Cited By 419[Bibtex] [PDF]
[176]Jianyong WangJiawei HanJian PeiCLOSET+: searching for the best strategies for mining frequent closed itemsets.  KDD'2003. pp.236~245    Cited By 358[Bibtex] [PDF]
[175]Xifeng YanJiawei HanCloseGraph: mining closed frequent graph patterns.  KDD'2003. pp.286~295    Cited By 347[Bibtex] [PDF]
[174]Hwanjo YuJiong YangJiawei HanClassifying large data sets using SVMs with hierarchical clusters.  KDD'2003. pp.306~315    Cited By 132[Bibtex] [PDF]
[173]Xifeng YanJiawei HanRamin AfsharCloSpan: Mining Closed Sequential Patterns in Large Databases.  SDM'2003.     Cited By 141[Bibtex]
[172]Xiaoxin YinJiawei HanCPAR: Classification based on Predictive Association Rules.  SDM'2003.    [Bibtex] [PDF]
[171]Charu C. AggarwalJiawei HanJianyong WangPhilip S. YuA Framework for Clustering Evolving Data Streams.  VLDB'2003. pp.81~92    Cited By 516[Bibtex] [PDF]
[170]Dong XinJiawei HanXiaolei LiBenjamin W. WahStar-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration.  VLDB'2003. pp.476~487    Cited By 104[Bibtex] [PDF]
[169]AnHai DoanYing LuYoonkyong LeeJiawei HanProfile-Based Object Matching for Information Integration. IEEE Intelligent Systems, 2003: 54~59    Cited By 27[Bibtex]
[168]Ying LuJiawei HanCancer classification using gene expression data. Inf. Syst., 2003: 243~268    Cited By 99[Bibtex]
[167]Anthony K. H. TungHongjun LuJiawei HanLing FengEfficient Mining of Intertransaction Association Rules. IEEE Trans. Knowl. Data Eng., 2003: 43~56    Cited By 114[Bibtex]
[166]Ke WangYu HeJiawei HanPushing Support Constraints Into Association Rules Mining. IEEE Trans. Knowl. Data Eng., 2003: 642~658    Cited By 32[Bibtex]
2002(21)
[165]Jian PeiJiawei HanWei WangMining sequential patterns with constraints in large databases.  CIKM'2002. pp.18~25    Cited By 162[Bibtex] [PDF]
[164]Yixin ChenGuozhu DongJiawei HanJian PeiBenjamin W. WahJianyong WangOnline Analytical Processing Stream Data: Is It Feasible?.  DMKD'2002.     Cited By 15[Bibtex]
[163]Ke WangSenqiang ZhouJiawei HanProfit Mining: From Patterns to Actions.  EDBT'2002. pp.70~87    Cited By 53[Bibtex] [PDF]
[162]Jiawei HanJianyong WangYing LuPetre TzvetkovMining Top-K Frequent Closed Patterns without Minimum Support.  ICDM'2002. pp.211~218    Cited By 126[Bibtex] [PDF]
[161]Jian PeiGuozhu DongWei ZouJiawei HanOn Computing Condensed Frequent Pattern Bases.  ICDM'2002. pp.378~385    Cited By 48[Bibtex] [PDF]
[160]Xifeng YanJiawei HangSpan: Graph-Based Substructure Pattern Mining.  ICDM'2002. pp.721~724    Cited By 754[Bibtex] [PDF]
[159]Hwanjo YuKevin Chen-Chuan ChangJiawei HanHeterogeneous Learner for Web Page Classification.  ICDM'2002. pp.538~545    Cited By 17[Bibtex] [PDF]
[158]Junqiang LiuYunhe PanKe WangJiawei HanMining frequent item sets by opportunistic projection.  KDD'2002. pp.229~238    Cited By 147[Bibtex] [PDF]
[157]Hwanjo YuJiawei HanKevin Chen-Chuan ChangPEBL: positive example based learning for Web page classification using SVM.  KDD'2002. pp.239~248    Cited By 141[Bibtex] [PDF]
[156]Jiawei HanHow Can Data Mining Help Bio-Data Analysis?.  BIOKDD'2002. pp.1~2    Cited By 43[Bibtex]
[155]Ke WangLiu TangJiawei HanJunqiang LiuTop Down FP-Growth for Association Rule Mining.  PAKDD'2002. pp.334~340    Cited By 64[Bibtex]
[154]Jiawei HanJianyong WangGuozhu DongJian PeiKe WangCubeExplorer: online exploration of data cubes.  SIGMOD Conference'2002. pp.626~626    Cited By 3[Bibtex]
[153]Jiong YangWei WangPhilip S. YuJiawei HanMining long sequential patterns in a noisy environment.  SIGMOD Conference'2002. pp.406~417    Cited By 122[Bibtex] [PDF]
[152]Yixin ChenGuozhu DongJiawei HanBenjamin W. WahJianyong WangMulti-Dimensional Regression Analysis of Time-Series Data Streams.  VLDB'2002. pp.323~334    Cited By 224[Bibtex]
[151]Laks V. S. LakshmananJian PeiJiawei HanQuotient Cube: How to Summarize the Semantics of a Data Cube.  VLDB'2002. pp.778~789    Cited By 178[Bibtex]
[150]Jiawei HanRuss B. AltmanVipin KumarHeikki MannilaDaryl PregibonEmerging scientific applications in data mining. Commun. ACM, 2002: 54~58    Cited By 55[Bibtex]
[149]Jiawei HanKevin Chen-Chuan ChangData Mining for Web Intelligence. IEEE Computer, 2002: 64~70    Cited By 75[Bibtex] [PDF]
[148]Jian PeiJiawei HanConstrained frequent pattern mining: a pattern-growth view. SIGKDD Explorations, 2002: 31~39    Cited By 65[Bibtex]
[147]Marianne WinslettKevin Chen-Chuan ChangAnHai DoanJiawei HanChengXiang ZhaiYuanyuan ZhouDatabase Research at the University of Illinois at Urbana-Champaign. SIGMOD Record, 2002: 97~102   [Bibtex]
[146]Raymond T. NgJiawei HanCLARANS: A Method for Clustering Objects for Spatial Data Mining. IEEE Trans. Knowl. Data Eng., 2002: 1003~1016    Cited By 265[Bibtex]
[145]Ling FengJeffrey Xu YuHongjun LuJiawei HanA template model for multidimensional inter-transactional association rules. VLDB J., 2002: 153~175    Cited By 20[Bibtex]
2001(15)
[144]Helen PintoJiawei HanJian PeiKe WangQiming ChenUmeshwar DayalMulti-Dimensional Sequential Pattern Mining.  CIKM'2001. pp.81~88    Cited By 144[Bibtex] [PDF]
[143]Sonny Han Seng CheeJiawei HanKe WangRecTree: An Efficient Collaborative Filtering Method.  DaWaK'2001. pp.141~151    Cited By 47[Bibtex]
[142]Jian PeiAnthony K. H. TungJiawei HanFault-Tolerant Frequent Pattern Mining: Problems and Challenges.  DMKD'2001.     Cited By 59[Bibtex] [PDF]
[141]Jian PeiJiawei HanLaks V. S. LakshmananMining Frequent Item Sets with Convertible Constraints.  ICDE'2001. pp.433~442   [Bibtex] [PDF]
[140]Jian PeiJiawei HanBehzad Mortazavi-AslHelen PintoQiming ChenUmeshwar DayalMeichun HsuPrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth.  ICDE'2001. pp.215~224    Cited By 295[Bibtex] [PDF]
[139]Anthony K. H. TungJean HouJiawei HanSpatial Clustering in the Presence of Obstacles.  ICDE'2001. pp.359~367    Cited By 134[Bibtex] [PDF]
[138]Wenmin LiJiawei HanJian PeiCMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules.  ICDM'2001. pp.369~376   [Bibtex] [PDF]
[137]Jian PeiJiawei HanHongjun LuShojiro NishioShiwei TangDongqing YangH-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases.  ICDM'2001. pp.441~448    Cited By 223[Bibtex] [PDF]
[136]Anthony K. H. TungRaymond T. NgLaks V. S. LakshmananJiawei HanConstraint-based clustering in large databases.  ICDT'2001. pp.405~419   [Bibtex] [PDF]
[135]Wen JinAnthony K. H. TungJiawei HanMining top-n local outliers in large databases.  KDD'2001. pp.293~298    Cited By 154[Bibtex] [PDF]
[134]Jiawei HanLaks V. S. LakshmananJian PeiScalable frequent-pattern mining methods: an overview.  KDD Tutorials'2001.     Cited By 4[Bibtex]
[133]Jiawei HanJian PeiGuozhu DongKe WangEfficient Computation of Iceberg Cubes with Complex Measures.  SIGMOD Conference'2001. pp.1~12    Cited By 187[Bibtex]
[132]Jiawei HanHasan M. JamilYing LuLiangyou ChenYaqin LiaoJian PeiDNA-Miner: A System Prototype for Mining DNA Sequences.  SIGMOD Conference'2001. pp.618~618    Cited By 15[Bibtex]
[131]Guozhu DongJiawei HanJoyce M. W. LamJian PeiKe WangMining Multi-Dimensional Constrained Gradients in Data Cubes.  VLDB'2001. pp.321~330    Cited By 50[Bibtex]
[130]Kenneth A. RossJiawei HanNick KoudasRajeev RastogiDaniel J. RosenkrantzPeter ScheuermannDan SuciuReminiscences on Influential Papers. SIGMOD Record, 2001: 101~104   [Bibtex]
2000(18)
[129]Jiawei HanMicheline KamberData Mining: Concepts and Techniques. 2000.     Cited By 9913[Bibtex] [PDF]
[128]Jiawei HanMicheline KamberData Mining: Concepts and Techniques. 2000.     Cited By 9913[Bibtex] [PDF]
[127]Jiawei HanMicheline KamberData Mining: Concepts and Techniques. 2000.     Cited By 9913[Bibtex] [PDF]
[126]Edward KimJoyce M. W. LamJiawei HanAIM: Approximate Intelligent Matching for Time Series Data.  DaWaK'2000. pp.347~357    Cited By 5[Bibtex]
[125]Jian PeiJiawei HanRunying MaoCLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets.  ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery'2000. pp.21~30    Cited By 660[Bibtex]
[124]Osmar R. ZaianeJiawei HanHua ZhuMining Recurrent Items in Multimedia with Progressive Resolution Refinement.  ICDE'2000. pp.461~470    Cited By 79[Bibtex]
[123]Jiawei HanJian PeiBehzad Mortazavi-AslQiming ChenUmeshwar DayalMeichun HsuFreeSpan: frequent pattern-projected sequential pattern mining.  KDD'2000. pp.355~359    Cited By 412[Bibtex] [PDF]
[122]Jian PeiJiawei HanCan we push more constraints into frequent pattern mining?.  KDD'2000. pp.350~354    Cited By 170[Bibtex]
[121]Anthony K. H. TungRaymond T. NgLaks V. S. LakshmananJiawei HanGeo-Spatial Clustering with User-Specified Constraints.  MDM/KDD'2000. pp.1~7    Cited By 14[Bibtex]
[120]Jian PeiJiawei HanBehzad Mortazavi-AslHua ZhuMining Access Patterns Efficiently from Web Logs.  PAKDD'2000. pp.396~407    Cited By 386[Bibtex] [PDF]
[119]Anthony K. H. TungJean HouJiawei HanCOE: Clustering with Obstacles Entities. A Preliminary Study.  PAKDD'2000. pp.165~168    Cited By 13[Bibtex]
[118]Jiawei HanJian PeiYiwen YinMining Frequent Patterns without Candidate Generation.  SIGMOD Conference'2000. pp.1~12   [Bibtex] [PDF]
[117]Ke WangYu HeJiawei HanMining Frequent Itemsets Using Support Constraints.  VLDB'2000. pp.43~52    Cited By 116[Bibtex]
[116]David Wai-Lok CheungH. Y. HwangAda Wai-Chee FuJiawei HanEfficient Rule-Based Attribute-Oriented Induction for Data Mining. J. Intell. Inf. Syst., 2000: 175~200    Cited By 18[Bibtex] [PDF]
[115]Jiawei HanJian PeiMining Frequent Patterns by Pattern-Growth: Methodology and Implications. SIGKDD Explorations, 2000: 14~20    Cited By 138[Bibtex]
[114]Harvey J. MillerJiawei HanDiscovering Geographic Knowledge in Data Rich Environments: A Report on a Specialist Meeting. SIGKDD Explorations, 2000: 105~107    Cited By 7[Bibtex]
[113]Nebojsa StefanovicJiawei HanKrzysztof KoperskiObject-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes. IEEE Trans. Knowl. Data Eng., 2000: 938~958    Cited By 118[Bibtex]
[112]Hongjun LuLing FengJiawei HanBeyond intratransaction association analysis: mining multidimensional intertransaction association rules. ACM Trans. Inf. Syst., 2000: 423~454    Cited By 113[Bibtex]
1999(11)
[111]Ling FengHongjun LuJeffrey Xu YuJiawei HanMining Inter-Transaction Associations with Templates.  CIKM'1999. pp.225~233    Cited By 18[Bibtex]
[110]Jiawei HanQiang YangEdward KimPlan Mining by Divide-and-Conquer.  1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery'1999.     Cited By 7[Bibtex] [PDF]
[109]Jiawei HanGuozhu DongYiwen YinEfficient Mining of Partial Periodic Patterns in Time Series Database.  ICDE'1999. pp.106~115    Cited By 394[Bibtex] [PDF]
[108]Anthony K. H. TungHongjun LuJiawei HanLing FengBreaking the Barrier of Transactions: Mining Inter-Transaction Association Rules.  KDD'1999. pp.297~301    Cited By 72[Bibtex] [PDF]
[107]Laks V. S. LakshmananRaymond T. NgJiawei HanAlex PangOptimization of Constrained Frequent Set Queries with 2-variable Constraints.  SIGMOD Conference'1999. pp.157~168    Cited By 183[Bibtex] [PDF]
[106]Raymond T. NgLaks V. S. LakshmananJiawei HanTeresa MahExploratory Mining via Constrained Frequent Set Queries.  SIGMOD Conference'1999. pp.556~558    Cited By 36[Bibtex]
[105]Xiaofang ZhouDavid TruffetJiawei HanEfficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining.  SSD'1999. pp.167~187    Cited By 43[Bibtex] [PDF]
[104]Jiawei HanLaks V. S. LakshmananRaymond T. NgConstraint-Based Multidimensional Data Mining. IEEE Computer, 1999: 46~50    Cited By 148[Bibtex]
[103]Jiawei HanReview - An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. ACM SIGMOD Digital Review, 1999.     Cited By 43[Bibtex]
[102]Jiawei HanYongjian FuMining Multiple-Level Association Rules in Large Databases. IEEE Trans. Knowl. Data Eng., 1999: 798~804    Cited By 212[Bibtex] [PDF]
[101]Jiawei HanZhaohui XieYongjian FuJoin Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases. IEEE Trans. Knowl. Data Eng., 1999: 321~337    Cited By 15[Bibtex]
1998(12)
[100]Osmar R. ZaianeMan XinJiawei HanDiscovering Web Access Patterns and Trends by Applying OLAP and Data Mining Technology on Web Logs.  ADL'1998. pp.19~29    Cited By 447[Bibtex] [PDF]
[99]Osmar R. ZaianeJiawei HanZe-Nian LiJean HouMining multimedia data.  CASCON'1998. pp.24~24    Cited By 68[Bibtex]
[98]Jiawei HanWan GongYiwen YinMining Segment-Wise Periodic Patterns in Time-Related Databases.  KDD'1998. pp.214~218    Cited By 140[Bibtex] [PDF]
[97]Jiawei HanNebojsa StefanovicKrzysztof KoperskiSelective Materialization: An Efficient Method for Spatial Data Cube Construction.  PAKDD'1998. pp.144~158    Cited By 142[Bibtex] [PDF]
[96]Raymond T. NgLaks V. S. LakshmananJiawei HanAlex PangExploratory Mining and Pruning Optimizations of Constrained Association Rules.  SIGMOD Conference'1998. pp.13~24   [Bibtex]
[95]Osmar R. ZaianeJiawei HanZe-Nian LiSonny Han Seng CheeJenny ChiangMultiMediaMiner: A System Prototype for Multimedia Data Mining.  SIGMOD Conference'1998. pp.581~583    Cited By 118[Bibtex] [PDF]
[94]Osmar R. ZaianeJiawei HanWebML: Querying the World-Wide Web for Resources and Knowledge.  Workshop on Web Information and Data Management'1998. pp.9~12    Cited By 2[Bibtex] [PDF]
[93]Raymond T. NgJiawei HanLaks V. S. LakshmananEditorial. Data Min. Knowl. Discov., 1998: 231~232   [Bibtex] [PDF]
[92]Jiawei HanShojiro NishioHiroyuki KawanoWei WangGeneralization-Based Data Mining in Object-Oriented Databases Using an Object Cube Model. Data Knowl. Eng., 1998: 55~97    Cited By 65[Bibtex]
[91]Jiawei HanLing LiuTong LuEvaluation of Declarative n-Queens Recursion: A Deductive Database Approach. Inf. Sci., 1998: 69~100   [Bibtex] [PDF]
[90]Deyi LiJiawei HanXuemei ShiMan-chung ChanKnowledge representation and discovery based on linguistic atoms. Knowl.-Based Syst., 1998: 431~440    Cited By 38[Bibtex]
[89]Jiawei HanTowards On-Line Analytical Mining in Large Databases. SIGMOD Record, 1998: 97~107    Cited By 143[Bibtex] [PDF]
1997(6)
[88]Jiawei HanJenny ChiangSonny Han Seng CheeJianping ChenQing ChenShan ChengWan GongMicheline KamberKrzysztof KoperskiGang LiuYijun LuNebojsa StefanovicLara WinstoneBetty XiaOsmar R. ZaianeShuhua ZhangHua ZhuDBMiner: a system for data mining in relational databases and data warehouses.  CASCON'1997. pp.8~8    Cited By 61[Bibtex] [PDF]
[87]Jiawei HanOLAP Mining: Integration of OLAP with Data Mining.  DS-7'1997. pp.3~20    Cited By 43[Bibtex]
[86]Jiawei HanData Mining: Where is it Heading? (Panel).  ICDE'1997. pp.508~508    Cited By 43[Bibtex] [PDF]
[85]Micheline KamberJiawei HanJenny ChiangMetarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes.  KDD'1997. pp.207~210    Cited By 218[Bibtex] [PDF]
[84]Micheline KamberLara WinstoneWang GonJiawei HanGeneralization and Decision Tree Induction: Efficient Classification in Data Mining.  RIDE'1997. pp.0~0   [Bibtex] [PDF]
[83]Jiawei HanKrzysztof KoperskiNebojsa StefanovicGeoMiner: A System Prototype for Spatial Data Mining.  SIGMOD Conference'1997. pp.553~556    Cited By 184[Bibtex] [PDF]
1996(10)
[82]Jiawei HanYongjian FuAttribute-Oriented Induction in data Mining.  Advances in Knowledge Discovery and Data Mining, 1996: 399~421   [Bibtex]
[81]Krzysztof KoperskiJunas AdhikaryJiawei HanSpatial Data Mining: Progress and Challenges.  DMKD'1996. pp.0~0   [Bibtex] [PDF]
[80]David Wai-Lok CheungJiawei HanVincent T. Y. NgC. Y. WongMaintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique.  ICDE'1996. pp.106~114    Cited By 640[Bibtex] [PDF]
[79]Jiawei HanYongjian FuWei WangJenny ChiangWan GongKrzysztof KoperskiDeyi LiYijun LuAmynmohamed RajanNebojsa StefanovicBetty XiaOsmar R. ZaianeDBMiner: A System for Mining Knowledge in Large Relational Databases.  KDD'1996. pp.250~255   [Bibtex] [PDF]
[78]David Wai-Lok CheungJiawei HanVincent T. Y. NgAda Wai-Chee FuYongjian FuA Fast Distributed Algorithm for Mining Association Rules.  PDIS'1996. pp.31~42    Cited By 275[Bibtex] [PDF]
[77]Jiawei HanData Mining Techniques.  SIGMOD Conference'1996. pp.545~545    Cited By 83[Bibtex]
[76]Jiawei HanYongjian FuWei WangJenny ChiangOsmar R. ZaianeKrzysztof KoperskiDBMiner: Interactive Mining of Multiple-Level Knowledge in Relational Databases.  SIGMOD Conference'1996. pp.550~550    Cited By 13[Bibtex] [PDF]
[75]Ming-Syan ChenJiawei HanPhilip S. YuData Mining: An Overview from a Database Perspective. IEEE Trans. Knowl. Data Eng., 1996: 866~883    Cited By 1551[Bibtex] [PDF]
[74]Jiawei HanYue HuangNick CerconeYongjian FuIntelligent Query Answering by Knowledge Discovery Techniques. IEEE Trans. Knowl. Data Eng., 1996: 373~390   [Bibtex] [PDF]
[73]Beng Chin OoiJiawei HanHongjun LuKian-Lee TanIndex Nesting - An Efficient Approach to Indexing in Object-Oriented Databases. VLDB J., 1996: 215~228    Cited By 19[Bibtex]
1995(12)
[72]Jiawei HanMining Knowledge at Multiple Concept Levels.  CIKM'1995. pp.19~24    Cited By 43[Bibtex] [PDF]
[71]Zhaohui XieJiawei HanNormalization and Compilation of Deductive and Object-Oriented Databases Programs for Efficient Query Evaluation.  DOOD'1995. pp.485~502   [Bibtex]
[70]David Wai-Lok CheungJiawei HanMaintenance of Discovered Knowledge: A Strategy for Updating Association Rules (Abstract).  KDOOD/TDOOD'1995. pp.58~60   [Bibtex]
[69]Yongjian FuJiawei HanMeta-Rule-Guided Mining of Association Rules in Relational Databases.  KDOOD/TDOOD'1995. pp.39~46    Cited By 100[Bibtex] [PDF]
[68]Jiawei HanYongjian FuSimon TangAdvances of the DBLearn System for Knowledge Discovery in Large Databases.  IJCAI'1995. pp.2049~2050   [Bibtex] [PDF]
[67]Osmar R. ZaianeJiawei HanResource and Knowledge Discovery in Global Information Systems: A Preliminary Design and Experiment.  KDD'1995. pp.331~336    Cited By 31[Bibtex] [PDF]
[66]Krzysztof KoperskiJiawei HanDiscovery of Spatial Association Rules in Geographic Information Databases.  SSD'1995. pp.47~66    Cited By 509[Bibtex] [PDF]
[65]Jiawei HanYongjian FuDiscovery of Multiple-Level Association Rules from Large Databases.  VLDB'1995. pp.420~431    Cited By 1006[Bibtex] [PDF]
[64]Wei LuJiawei HanInformation-Associated Join Indices for Spatial Range Search. International Journal of Geographical Information Systems, 1995: 221~249    Cited By 7[Bibtex]
[63]Yan-Nong HuangVeronica DahlJiawei HanFact Updates in Logic Databases. International Journal of Software Engineering and Knowledge Engineering, 1995: 467~491    Cited By 2[Bibtex]
[62]Jiawei HanLaks V. S. LakshmananEvaluation of Regular Nonlinear Recursions by Deductive Database Techniques. Inf. Syst., 1995: 419~441   [Bibtex]
[61]Jiawei HanChain-Split Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng., 1995: 261~273    Cited By 43[Bibtex] [PDF]
1994(14)
[60]Jiawei HanLing LiuZhaohui XieLogicBase: A Deductive Database System Prototype.  CIKM'1994. pp.226~233    Cited By 21[Bibtex]
[59]Jiawei HanYongjian FuRaymond T. NgCooperative Query Answering Using Multiple Layered Databases.  CoopIS'1994. pp.47~58   [Bibtex] [PDF]
[58]Hiroyuki KawanoShojiro NishioJiawei HanToshiharu HasegawaHow Does Knowledge Discovery Cooperate with Active Database Techniques in Controlling Dynamic Environment?.  DEXA'1994. pp.370~379    Cited By 10[Bibtex]
[57]David Wai-Lok CheungAda Wai-Chee FuJiawei HanA Case-Based Reasoning Approach for Associative Query Answering.  ISMIS'1994. pp.164~173    Cited By 2[Bibtex]
[56]Yan-Nong HuangVeronica DahlJiawei HanIncremental Processing of Logic Database Relations.  ISMIS'1994. pp.561~570    Cited By 1[Bibtex]
[55]Jiawei HanYongjian FuDynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases.  KDD Workshop'1994. pp.157~168    Cited By 184[Bibtex] [PDF]
[54]Jiawei HanYongjian FuYue HuangYandong CaiNick CerconeDBLearn: A System Prototype for Knowledge Discovery in Relational Databases.  SIGMOD Conference'1994. pp.516~516    Cited By 26[Bibtex]
[53]Raymond T. NgJiawei HanEfficient and Effective Clustering Methods for Spatial Data Mining.  VLDB'1994. pp.144~155    Cited By 1534[Bibtex] [PDF]
[52]Zhaohui XieJiawei HanJoin Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases.  VLDB'1994. pp.522~533    Cited By 66[Bibtex]
[51]Jim GemmellJiawei HanRichard J. BeatonStavros ChristodoulakisDelay-Sensitive Multimedia on Disks. IEEE MultiMedia, 1994: 56~67    Cited By 41[Bibtex]
[50]Jim GemmellJiawei HanMultichannel Delay Sensitive Data Retrieval. Multimedia Syst., 1994: 240~252   [Bibtex]
[49]Jiawei HanTowards Efficient Induction Mechanisms in Database Systems. Theor. Comput. Sci., 1994: 361~385    Cited By 43[Bibtex]
[48]Jiawei HanConstraint-Based Query Evaluation in Deductive Databases. IEEE Trans. Knowl. Data Eng., 1994: 96~107    Cited By 43[Bibtex] [PDF]
[47]Wenyu LuDik Lun LeeJiawei HanA Study on the Structure of Linear Recursion. IEEE Trans. Knowl. Data Eng., 1994: 723~737    Cited By 4[Bibtex]
1993(9)
[46]Jiawei HanLing LiuZhaohui XieLogicBase: A System Prototype for Deductive Query Evaluation.  Workshop on Programming with Logic Databases (Informal Proceedings), ILPS'1993. pp.146~160    Cited By 3[Bibtex]
[45]Jiawei HanLing LiuZhaohui XieOutline of the LogicBase Demonstration.  Workshop on Programming with Logic Databases (Informal Proceedings), ILPS'1993. pp.165~165   [Bibtex]
[44]Jiawei HanKangsheng ZengTong LuNormalization of Linear Recursions in Deductive Databases.  ICDE'1993. pp.559~567    Cited By 7[Bibtex] [PDF]
[43]Laks V. S. LakshmananKarima AshrafJiawei HanHomomorphic Tree Embeddings and Their Applications to Recursive Program Optimization.  LICS'1993. pp.344~353    Cited By 3[Bibtex] [PDF]
[42]Nick CerconePaul McFetridgeJiawei HanFred PopowichHuman-Computer Interfaces: DBLEARN and System X.  RSKD'1993. pp.32~43    Cited By 1[Bibtex]
[41]Xiaohua HuNick CerconeJiawei HanAn Attribute-Oriented Rough Set Approach for Knowledge Discovery in Databases.  RSKD'1993. pp.90~99    Cited By 28[Bibtex]
[40]Jiawei HanLaks V. S. LakshmananEvaluation of Regular Nonlinear Recursive Programs.  ILPS'1993. pp.648~648   [Bibtex]
[39]Jiawei HanCompilation and evaluation of linear mutual recursions. Inf. Sci., 1993: 157~183    Cited By 43[Bibtex]
[38]Jiawei HanYandong CaiNick CerconeData-Driven Discovery of Quantitative Rules in Relational Databases. IEEE Trans. Knowl. Data Eng., 1993: 29~40    Cited By 445[Bibtex]
1992(11)
[37]Jiawei HanEfficient Deduction and Induction: Key to the Success of Data-Intensive Knowledge-Base Systems.  Formal Methods in Databases and Software Engineering'1992. pp.139~157    Cited By 43[Bibtex]
[36]Ling LiuJiawei HanCompressed Counting Method.  Workshop on Deductive Databases, JICSLP'1992. pp.76~85    Cited By 1[Bibtex]
[35]Jiawei HanTong LuN-Queens Problem Revisited: A Deductive Database Approach.  Workshop on Deductive Databases, JICSLP'1992. pp.48~55   [Bibtex]
[34]Jiawei HanCompilation-Based List Processing in Deductive Databases.  EDBT'1992. pp.104~119    Cited By 43[Bibtex]
[33]Jiawei HanChain-Split Evaluation in Deductive Databases.  ICDE'1992. pp.376~384    Cited By 43[Bibtex] [PDF]
[32]Wei LuJiawei HanDistance-Associated Join Indices for Spatial Range Search.  ICDE'1992. pp.284~292    Cited By 57[Bibtex] [PDF]
[31]Jiawei HanChain-Based Evaluation - A Bridge Linking Recursive and Nonrecursive Query Evaluation.  RIDE-TQP'1992. pp.132~139    Cited By 43[Bibtex]
[30]Jiawei HanYandong CaiNick CerconeKnowledge Discovery in Databases: An Attribute-Oriented Approach.  VLDB'1992. pp.547~559    Cited By 423[Bibtex] [PDF]
[29]Jiawei HanBinding Propagation Beyond the Reach of Rule/Goal Graphs. Inf. Process. Lett., 1992: 263~268    Cited By 43[Bibtex]
[28]Jiawei HanKangsheng ZengAutomatic generation of compiled forms for linear recursions. Inf. Syst., 1992: 299~322    Cited By 15[Bibtex]
[27]Cheong YounHyoung-Joo KimLawrence J. HenschenJiawei HanClassification and Compilation of Linear Recursive Queries in Deductive Databases. IEEE Trans. Knowl. Data Eng., 1992: 52~67    Cited By 7[Bibtex]
1991(8)
[26]Yandong CaiNick CerconeJiawei HanAttribute-Oriented Induction in Relational Databases.  Knowledge Discovery in Databases, 1991: 213~228   [Bibtex]
[25]Chee Chin LowHongjun LuBeng Chin OoiJiawei HanEfficient Access Methods in Deductive and Object-Oriented Databases.  DOOD'1991. pp.68~84    Cited By 15[Bibtex]
[24]Yandong CaiNick CerconeJiawei HanLearning in relational databases: an attribute-oriented approach. Computational Intelligence, 1991: 119~132    Cited By 29[Bibtex]
[23]Jiawei HanOn the Power of Query-Independent Compilation.  ICCI'1991. pp.185~196    Cited By 43[Bibtex] [PDF]
[22]Jiawei HanConstraint-Based Reasoning in Deductive Databases.  ICDE'1991. pp.257~265    Cited By 43[Bibtex] [PDF]
[21]Jiawei HanQiang WangEfficient Evaluation of Linear Recursions with Function Sysmbols in Deductive Databases.  ISMIS'1991. pp.132~141   [Bibtex]
[20]Jiawei HanQiang WangEvaluation of functional linear recursions: a compilation approach. Inf. Syst., 1991: 463~469   [Bibtex]
[19]Jiawei HanLing LiuEfficient Evaluation of Multiple Linear Recursions. IEEE Trans. Software Eng., 1991: 1241~1252    Cited By 9[Bibtex]
1990(3)
[18]Yandong CaiNick CerconeJiawei HanAn Attribute-Oriented Approach for Learning Classification Rules from Relational Databases.  ICDE'1990. pp.281~288    Cited By 50[Bibtex] [PDF]
[17]W. S. LukWeining ZhangJiawei HanPath: An Approach to Incorporate List Processing in A Relational Database.  SEKE'1990. pp.189~194    Cited By 3[Bibtex]
[16]Jiawei HanFrom transitive closure recursions to single-chain recursions. Inf. Syst., 1990: 479~488    Cited By 43[Bibtex]
1989(7)
[15]Jiawei HanWenyu LuAsynchronous Chain Recursions.  DASFAA'1989. pp.285~292    Cited By 23[Bibtex]
[14]Jiawei HanLawrence J. HenschenThe Level-Cycle Merging Method.  DOOD'1989. pp.65~81    Cited By 19[Bibtex]
[13]Jiawei HanCompiling general linear recursions by variable connection graph analysis. Computational Intelligence, 1989: 12~31    Cited By 43[Bibtex]
[12]Jiawei HanLawrence J. HenschenNing ZhuangDerivation of Magic Sets by Compilation.  SEKE'1989. pp.164~171   [Bibtex]
[11]Jiawei HanLing LiuProcessing Multiple Linear Recursions.  NACLP'1989. pp.816~830    Cited By 9[Bibtex]
[10]Jiawei HanMulti-way counting method. Inf. Syst., 1989: 219~229    Cited By 43[Bibtex]
[9]Jiawei HanWenyu LuAsynchronous Chain Recursions. IEEE Trans. Knowl. Data Eng., 1989: 185~195    Cited By 23[Bibtex]
1988(6)
[8]Jiawei HanGhassan Z. QadahChinying ChaouThe Processing and Evaluation of Transitive Closure Queries.  EDBT'1988. pp.49~75    Cited By 20[Bibtex]
[7]Sanggoo LeeJiawei HanSemantic Query Optimization in Recursive Databases.  ICDE'1988. pp.444~451    Cited By 28[Bibtex] [PDF]
[6]Jiawei HanWo-Shun LukWhat Kinds of Recursion Can Be Processed by Transitive Closure Strategies?.  ISMIS'1988. pp.170~179   [Bibtex]
[5]Jiawei HanSelection of Processing Strategies for Different Recursive Queries.  JCDKB'1988. pp.59~68    Cited By 43[Bibtex]
[4]Cheong YounLawrence J. HenschenJiawei HanOne-Directional Recursive Formulas.  JCDKB'1988. pp.69~78    Cited By 1[Bibtex]
[3]Cheong YounLawrence J. HenschenJiawei HanClassification of Recursive Formulas in Deductive Databases.  SIGMOD Conference'1988. pp.320~328    Cited By 23[Bibtex]
1987(1)
[2]Jiawei HanLawrence J. HenschenHandling Redundancy in the Processing of Recursive Database Queries.  SIGMOD Conference'1987. pp.73~81    Cited By 32[Bibtex]
1986(1)
[1]Jiawei HanHongjun LuSome Performance Results on Recursive Query Processing in Relational Database Systems.  ICDE'1986. pp.533~541    Cited By 37[Bibtex] [PDF]