default search action
Kazutaka Furuse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c32]Taichi Nakashima
, Hanxiong Chen
Improving Serendipity for Collaborative Metric Learning Based on Mutual Proximity. DaWaK 2024: 177-191 - 2021
- [c31]Hina Suzuki, Hanxiong Chen, Kazutaka Furuse, Toshiyuki Amagasa:
Dense Nearest Neighborhood Query. INTAP 2021: 3-16
2010 – 2019
- 2019
- [c30]Sang Le, Yuyang Dong, Hanxiong Chen, Kazutaka Furuse:
Balanced Nearest Neighborhood Query in Spatial Database. BigComp 2019: 1-4 - 2018
- [j6]Yuyang Dong, Hanxiong Chen, Kazutaka Furuse, Hiroyuki Kitagawa
Efficient Methods for Aggregate Reverse Rank Queries. IEICE Trans. Inf. Syst. 101-D(4): 1012-1020 (2018) - [j5]Yuyang Dong, Hanxiong Chen, Kazutaka Furuse, Hiroyuki Kitagawa
Bound-and-Filter Framework for Aggregate Reverse Rank Queries. Trans. Large Scale Data Knowl. Centered Syst. 38: 1-26 (2018) - [j4]Yuyang Dong, Hanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, Hiroyuki Kitagawa
Weighted Aggregate Reverse Rank Queries. ACM Trans. Spatial Algorithms Syst. 4(2): 5:1-5:23 (2018) - 2017
- [c29]Yuyang Dong, Hanxiong Chen, Kazutaka Furuse, Hiroyuki Kitagawa
Efficient Processing of Aggregate Reverse Rank Queries. DEXA (1) 2017: 159-166 - [c28]Yuyang Dong, Hanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, Hiroyuki Kitagawa
Grid-Index Algorithm for Reverse Rank Queries. EDBT 2017: 306-317 - 2016
- [c27]Yuyang Dong, Hanxiong Chen, Kazutaka Furuse, Hiroyuki Kitagawa
Aggregate Reverse Rank Queries. DEXA (2) 2016: 87-101 - 2014
- [c26]Atsuhiro Ichikawa, Hanxiong Chen, Kazutaka Furuse:
Efficient reverse far neighbors search. ICDIM 2014: 214-219 - 2012
- [c25]Jianquan Liu
An Efficient Algorithm for Arbitrary Reverse Furthest Neighbor Queries. APWeb 2012: 60-72 - 2011
- [j3]Hanxiong Chen, Jianquan Liu
Indexing expensive functions for efficient multi-dimensional similarity search. Knowl. Inf. Syst. 27(2): 165-192 (2011) - [c24]Jianquan Liu
On Efficient Distance-Based Similarity Search. ICDM Workshops 2011: 1199-1202 - [c23]Kazutaka Furuse, Hiroaki Ohmura, Hanxiong Chen, Hiroyuki Kitagawa
An Extended Method for Finding Related Web Pages with Focused Crawling Techniques. KES (2) 2011: 21-30 - 2010
- [c22]Jianquan Liu
An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index. DEXA (2) 2010: 437-451
2000 – 2009
- 2009
- [j2]Jianquan Liu, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
Improving User's Web Search Experience by Interactive Re-ranking and Zooming Interfaces. J. Digit. Inf. Manag. 7(1): 36-44 (2009) - [c21]Hanxiong Chen, Jianquan Liu
Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions. ADMA 2009: 67-78 - [c20]Jianquan Liu
Extracting Related Words from Anchor Text Clusters by Focusing on the Page Designer's Intention. DEXA 2009: 451-459 - 2008
- [c19]Sansarkhuu Namnandorj, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
Efficient Bounds in Finding Aggregate Nearest Neighbors. DEXA 2008: 693-700 - 2007
- [c18]Hanxiong Chen, Kousuke Yamamoto, Kazutaka Furuse, Nobuo Ohbo:
Supporting Web Search with Near Keywords. FSKD (2) 2007: 411-415 - [c17]Yanmin Luo, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
Efficient Methods in Finding Aggregate Nearest Neighbor by Projection-Based Filtering. ICCSA (3) 2007: 821-833 - [c16]Yanmin Luo, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo:
Finding aggregate nearest neighbor efficiently without indexing. Infoscale 2007: 48 - 2005
- [j1]Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
CVA file: an index structure for high-dimensional datasets. Knowl. Inf. Syst. 7(3): 337-357 (2005) - [c15]Chaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
Adaptive Query Refinement Based on Global and Local Analysis. FSKD (1) 2005: 584-593 - [c14]Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
Focused crawling by exploiting anchor text using decision tree. WWW (Special interest tracks and posters) 2005: 1190-1191 - 2004
- [c13]Chaoyuan Cui, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo:
Web Query Refinement without Information Loss. APWeb 2004: 363-372 - [c12]Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Seiichi Nishihara:
Improving Collaborative Filtering by W-clustering. Databases and Applications 2004: 81-86 - 2003
- [c11]Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo, Eamonn J. Keogh:
Grid-Based Indexing for Large Time Series Databases. IDEAL 2003: 614-621 - 2002
- [c10]Jiyuan An, Hanxiong Chen, Kazutaka Furuse, Masahiro Ishikawa, Nobuo Ohbo:
The Complex Polyhedra Technique: An Index Structure for High-Dimensional Space. Australasian Database Conference 2002 - [c9]Xiaowei Kan, Kazushige Asada, Atsushi Iizawa, Kazutaka Furuse:
2DS: A Two-dimensional Scheduling Scheme for Data Broadcast. ISDB 2002: 110-115 - [c8]Hanxiong Chen, Jiyuan An, Kazutaka Furuse, Nobuo Ohbo:
C2VA: Trim High Dimensional Indexes. WAIM 2002: 303-315 - 2001
- [c7]Xiaowei Kan, T. Ohwada, Kazushige Asada, Atsushi Iizawa, Kazutaka Furuse:
FBDA: A Filtering Mechanism Based on Distance Approximation. DASFAA 2001: 162-163 - [c6]Hanxiong Chen, Jeffrey Xu Yu, Kazutaka Furuse, Nobuo Ohbo:
Support IR Query Refinement by Partial Keyword Set. WISE (1) 2001: 245-253 - 2000
- [c5]Masahiro Ishikawa, Yi Liu, Kazutaka Furuse, Hanxiong Chen, Nobuo Ohbo:
MST Construction with Metric Matrix for Clustering. VDB 2000: 329- - [c4]Masahiro 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
1990 – 1999
- 1995
- [c3]Kazutaka Furuse, Kazushige Asada, Atsushi Iizawa:
Implementation and Performance Evaluation of Compressed Bit-Sliced Signature Files. CISMOD 1995: 164-177 - 1993
- [c2]Kazutaka Furuse, Jeffrey Xu Yu, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo:
A Guideline for Implementing Access Method Modules in Extensible DBMS MODUS. Australian Database Conference 1993: 39-54 - [c1]Kazutaka Furuse, Kazunori Yamaguchi, Hiroyuki Kitagawa, Nobuo Ohbo:
Abstract Indexing Mechanism of the Extensible DBMS Modus. DASFAA 1993: 189-196
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: