| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Anthony K. H. Tung Wen Jin , Yuelong Jiang , Weining Qian , Anthony K. H. Tung: Mining Outliers in Spatial Networks. DASFAA 2006 : 156-170 Chee Yong Chan , H. V. Jagadish , Kian-Lee Tan , Anthony K. H. Tung, Zhenjie Zhang : On High Dimensional Skylines. EDBT 2006 : 478-495 Xin Xu , Ying Lu , Anthony K. H. Tung, Wei Wang : Mining Shifting-and-Scaling Co-Regulation Patterns on Gene Expression Profiles. ICDE 2006 : 89 Stéphane Bressan , Anthony K. H. Tung, Rui Yang : Opportunities for XML Data Mining in Modern Applications, or XML Data Mining: Where Is the Ore? KDXD 2006 : 1 Wen Jin , Anthony K. H. Tung, Jiawei Han , Wei Wang : Ranking Outliers Using Symmetric Neighborhood Relationship. PAKDD 2006 : 577-593 Xia Cao , Beng Chin Ooi , HweeHwa Pang , Kian-Lee Tan , Anthony K. H. Tung: DSIM: A Distance-Based Indexing Method for Genomic Sequences. BIBE 2005 : 97-104 Zhenjie Zhang , Xinyu Guo , Hua Lu , Anthony K. H. Tung, Nan Wang : Discovering strong skyline points in high dimensional spaces. CIKM 2005 : 247-248 Xia Cao , Shuai Cheng Li , Anthony K. H. Tung: Indexing DNA Sequences Using q-Grams. DASFAA 2005 : 4-16 Lei Liu , Jiong Yang , Anthony K. H. Tung: Data Mining Techniques for Microarray Datasets. ICDE 2005 : 1149 Feng Pan , Wei Wang , Anthony K. H. Tung, Jiong Yang : Finding Representative Set from Massive Data. ICDM 2005 : 338-345 Anirban Mondal , Anthony K. H. Tung, Masaru Kitsuregawa : kNR-tree: a novel R-tree-based index for facilitating spatial window queries on any k relations among N spatial relations in mobile environments. Mobile Data Management 2005 : 173-177 Anthony K. H. Tung, Xin Xu , Beng Chin Ooi : CURLER: Finding and Visualizing Nonlinear Correlated Clusters. SIGMOD Conference 2005 : 467-478 Gao Cong , Kian-Lee Tan , Anthony K. H. Tung, Xin Xu : Mining Top-k Covering Rule Groups for Gene Expression Data. SIGMOD Conference 2005 : 670-681 Rui Yang , Panos Kalnis , Anthony K. H. Tung: Similarity Evaluation on Tree-structured Data. SIGMOD Conference 2005 : 754-765 Liang Jin , Nick Koudas , Chen Li , Anthony K. H. Tung: Indexing Mixed Types for Approximate Retrieval. VLDB 2005 : 793-804 Chenyi Xia , David Hsu , Anthony K. H. Tung: A Fast Filter for Obstructed Nearest Neighbor Queries. BNCOD 2004 : 203-215 Qiang Jing , Rui Yang , Panos Kalnis , Anthony K. H. Tung: Localized signature table: fast similarity search on transaction data. CIKM 2004 : 314-323 Gao Cong , Beng Chin Ooi , Kian-Lee Tan , Anthony K. H. Tung: Go Green: Recycle and Reuse Frequent Patterns. ICDE 2004 : 128-139 Nick Koudas , Beng Chin Ooi , Heng Tao Shen , Anthony K. H. Tung: LDC: Enabling Search By Partial Distance In A Hyper-Dimensional Space. ICDE 2004 : 6-17 Zhenqiang Tan , Anthony K. H. Tung: Substructure Clustering on Sequential 3d Object Datasets. ICDE 2004 : 634-645 H. V. Jagadish , Raymond T. Ng , Beng Chin Ooi , Anthony K. H. Tung: ItCompress: An Iterative Semantic Compression Algorithm. ICDE 2004 : 646-657 Gao Cong , Kian-Lee Tan , Anthony K. H. Tung, Feng Pan : Mining Frequent Closed Patterns in Microarray Data. ICDM 2004 : 363-366 Cuiping Li , Gao Cong , Anthony K. H. Tung, Shan Wang : Incremental maintenance of quotient cube for median. KDD 2004 : 226-235 Gao Cong , Anthony K. H. Tung, Xin Xu , Feng Pan , Jiong Yang : FARMER: Finding Interesting Rule Groups in Microarray Datasets. SIGMOD Conference 2004 : 143-154 Feng Pan , Anthony K. H. Tung, Gao Cong , Xin Xu : COBBLER: Combining Column and Row Enumeration for Closed Pattern Discovery. SSDBM 2004 : 21-30 Xia Cao , Anthony K. H. Tung, Beng Chin Ooi , Kian-Lee Tan , Shuai Cheng Li : String Join Using Precedence Count Matrix. SSDBM 2004 : 345-348 Xin Xu , Gao Cong , Beng Chin Ooi , Kian-Lee Tan , Anthony K. H. Tung: Semantic Mining and Analysis of Gene Expression Data. VLDB 2004 : 1261-1264 Xia Cao , Shuai Cheng Li , Beng Chin Ooi , Anthony K. H. Tung: Piers: An Efficient Model for Similarity Search in DNA Sequence Databases. SIGMOD Record 33 (2): 39-44 (2004) Hongyu Wang , Beng Chin Ooi , Anthony K. H. Tung: Search: Mining Retrieval History for Content-Based Image Retrieval. DASFAA 2003 : 275- Feng Pan , Gao Cong , Anthony K. H. Tung, Jiong Yang , Mohammed Javeed Zaki : Carpenter: finding closed patterns in long biological datasets. KDD 2003 : 637-642 Zhenqiang Tan , Xia Cao , Beng Chin Ooi , Anthony K. H. Tung: The ed-tree: An Index for Large DNA Sequence Databases. SSDBM 2003 : 151-160 Anthony K. H. Tung, Hongjun Lu , Jiawei Han , Ling Feng : Efficient Mining of Intertransaction Association Rules. IEEE Trans. Knowl. Data Eng. 15 (1): 43-56 (2003) Jian Pei , Anthony K. H. Tung, Jiawei Han : Fault-Tolerant Frequent Pattern Mining: Problems and Challenges. DMKD 2001 Anthony K. H. Tung, Jean Hou , Jiawei Han : Spatial Clustering in the Presence of Obstacles. ICDE 2001 : 359-367 Anthony K. H. Tung, Raymond T. Ng , Laks V. S. Lakshmanan , Jiawei Han : Constraint-based clustering in large databases. ICDT 2001 : 405-419 Wen Jin , Anthony K. H. Tung, Jiawei Han : Mining top-n local outliers in large databases. KDD 2001 : 293-298 Anthony K. H. Tung, Raymond T. Ng , Laks V. S. Lakshmanan , Jiawei Han : Geo-Spatial Clustering with User-Specified Constraints. MDM/KDD 2000 : 1-7 Anthony K. H. Tung, Jean Hou , Jiawei Han : COE: Clustering with Obstacles Entities. A Preliminary Study. PAKDD 2000 : 165-168 Jason W. H. Lee , Y. C. Tay , Anthony K. H. Tung: MOO: A Methodology for Online Optimization through Mining the Offline Optimum CoRR cs.DS/0003072 : (2000) Anthony K. H. Tung, Hongjun Lu , Jiawei Han , Ling Feng : Breaking the Barrier of Transactions: Mining Inter-Transaction Association Rules. KDD 1999 : 297-301 Anthony K. H. Tung, Y. C. Tay , Hongjun Lu : BROOM: Buffer Replacement using Online Optimization by Mining. CIKM 1998 : 185-192 Ling Feng , Hongjun Lu , Y. C. Tay , Anthony K. H. Tung: Buffer Management in Distributed Database Systems: A Data Mining Based Approach. EDBT 1998 : 246-260 1 [ 39 ] 2 [ 12 ] [ 15 ] [ 17 ] [ 35 ] [ 37 ] 3 [ 41 ] 4 [ 13 ] [ 16 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 25 ] [ 30 ] 5 [ 1 ] [ 3 ] [ 11 ] 6 [ 36 ] 7 [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 38 ] 8 [ 5 ] [ 9 ] 9 [ 27 ] 10 [ 22 ] [ 41 ] 11 [ 42 ] 12 [ 28 ] 13 [ 7 ] [ 38 ] [ 42 ] 14 [ 26 ] 15 [ 26 ] [ 29 ] 16 [ 32 ] 17 [ 24 ] [ 28 ] 18 [ 6 ] [ 8 ] 19 [ 4 ] 20 [ 28 ] 21 [ 20 ] 22 [ 15 ] [ 17 ] [ 35 ] 23 [ 34 ] 24 [ 1 ] [ 2 ] [ 3 ] [ 11 ] 25 [ 36 ] 26 [ 40 ] 27 [ 32 ] 28 [ 6 ] [ 8 ] [ 22 ] 29 [ 12 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 22 ] [ 24 ] [ 25 ] [ 31 ] [ 37 ] 30 [ 13 ] [ 18 ] [ 19 ] [ 21 ] [ 33 ] 31 [ 37 ] 32 [ 10 ] 33 [ 42 ] 34 [ 24 ] 35 [ 16 ] [ 17 ] [ 21 ] [ 25 ] [ 30 ] [ 37 ] [ 41 ] 36 [ 12 ] [ 23 ] 37 [ 1 ] [ 2 ] [ 4 ] 38 [ 14 ] 39 [ 36 ] 40 [ 20 ] 41 [ 33 ] [ 38 ] [ 40 ] 42 [ 27 ] 43 [ 16 ] [ 18 ] [ 19 ] [ 30 ] [ 31 ] [ 40 ] 44 [ 13 ] [ 19 ] [ 33 ] [ 34 ] 45 [ 26 ] [ 29 ] [ 39 ] 46 [ 13 ] 47 [ 36 ] [ 41 ]  ©2006 Association for Computing Machinery |
