dblp.uni-trier.dewww.uni-trier.de

Hanxiong Chen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EESansarkhuu Namnandorj, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo: Efficient Bounds in Finding Aggregate Nearest Neighbors. DEXA 2008: 693-700
2007
20EEHanxiong Chen, K. Yamamoto, Kazutaka Furuse, Nobuo Ohbo: Supporting Web Search with Near Keywords. FSKD (2) 2007: 411-415
19EEYanmin Luo, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo: Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering. ICCSA (3) 2007: 821-833
18EEYanmin Luo, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo: Finding aggregate nearest neighbor efficiently without indexing. Infoscale 2007: 48
2005
17EEChaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo: Adaptive Query Refinement Based on Global and Local Analysis. FSKD (1) 2005: 584-593
16EEJiyuan An, Yi-Ping Phoebe Chen, Hanxiong Chen: DDR: an index method for large time-series datasets. Inf. Syst. 30(5): 333-348 (2005)
15EEJiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo: CVA file: an index structure for high-dimensional datasets. Knowl. Inf. Syst. 7(3): 337-357 (2005)
2004
14EEChaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo: Web Query Refinement without Information Loss. APWeb 2004: 363-372
13 Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Seiichi Nishihara: Improving Collaborative Filtering by W-clustering. Databases and Applications 2004: 81-86
2003
12EEJiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Eamonn J. Keogh: Grid-Based Indexing for Large Time Series Databases. IDEAL 2003: 614-621
2002
11EEJiyuan An, Hanxiong Chen, Kazutaka Furuse, Masahiro Ishikawa, Nobuo Ohbo: The Complex Polyhedra Technique: An Index Structure for High-Dimensional Space. Australasian Database Conference 2002
10EEHanxiong Chen, Jiyuan An, Kazutaka Furuse, Nobuo Ohbo: C2VA: Trim High Dimensional Indexes. WAIM 2002: 303-315
2001
9EEHanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, Nobuo Ohbo: Support IR Query Refinement by Partial Keyword Set. WISE (1) 2001: 245-253
2000
8 Masahiro Ishikawa, Yi Liu, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo: MST Construction with Metric Matrix for Clustering. VDB 2000: 329-
7EEMasahiro Ishikawa, Hanxiong Chen, Kazutaka Furuse, Jeffrey Xu Yu, Nobuo Ohbo: MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches. Web-Age Information Management 2000: 356-373
1999
6EEHanxiong Chen, Toshiro Ohno, Nobuo Ohbo: Processing Queries with Expensive Predicates by Filtering. COMPSAC 1999: 350-356
1998
5EEYe Liu, Hanxiong Chen, Jeffrey Xu Yu, Nobuo Ohbo: Using Stem Rules to Refine Document Retrieval Queries. FQAS 1998: 248-259
4 Ye Liu, Hanxiong Chen, Jeffrey Xu Yu, Nobuo Ohbo: A Data Mining Approach for Query Refinement. PAKDD 1998: 394-396
1993
3EEXiaodong Zhang, Nobuo Ohbo, Hanxiong Chen, Yuzuru Fujiwara: A Method of Using Semijoins to Optimizing Queries with ADT Functions. CIKM 1993: 723-725
2EEHanxiong Chen, Jeffrey Xu Yu, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo, Yuzuru Fujiwara: LRU-S: A New Buffer Allocation Approach for OODBMS. DASFAA 1993: 73-80
1992
1 Hanxiong Chen, Xu Yu, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo, Yuzuru Fujiwara: Decomposition - An Approach for Optimizing Queries Including ADT Functions. Inf. Process. Lett. 43(6): 327-333 (1992)

Coauthor Index

1Jiyuan An [10] [11] [12] [15] [16]
2Yi-Ping Phoebe Chen [16]
3Chaoyuan Cui [14] [17]
4Yuzuru Fujiwara [1] [2] [3]
5Kazutaka Furuse [7] [8] [9] [10] [11] [12] [13] [14] [15] [17] [18] [19] [20] [21]
6Masahiro Ishikawa [7] [8] [11]
7Eamonn J. Keogh [12]
8Hiroyuki Kitagawa [1] [2]
9Ye Liu [4] [5]
10Yi Liu [8]
11Yanmin Luo [18] [19]
12Sansarkhuu Namnandorj [21]
13Seiichi Nishihara [13]
14Nobuo Ohbo [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [17] [18] [19] [20] [21]
15Toshiro Ohno [6]
16Kazunori Yamaguchi [1] [2]
17K. Yamamoto [20]
18Jeffrey Xu Yu [2] [4] [5] [7] [9]
19Xu Yu [1]
20Xiaodong Zhang [3]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)