大保 信夫 Ohbo Nobuo

Articles:  1-20 of 64

  • 1 / 4
  • Efficient Filtering for Aggregate Nearest Neighbor Search  [in Japanese]

    WANG MingXin , CHEN Hanxiong , FURUSE Kazutaka , OHBO Nobuo

    全国大会講演論文集 第70回(データベースとメディア), 625-626, 2008-03-13

    IPSJ  References (3)

  • Visualized Web Search Assistant

    LIU Jianquan , CHEN Hanxiong , FURUSE Kazutaka , OHBO Nobuo

    Web search is important in information retrieval applications, which is widely supported as online service by some well known search engines, such as Google and Yahoo!. However they are only running f …

    全国大会講演論文集 第70回(データベースとメディア), 495-496, 2008-03-13

    IPSJ  References (6)

  • 長大な時系列データに対する部分時系列データの類似検索手法の提案(セッション3:データマイニング)  [in Japanese]

    石川 雅弘 , 陳 漢雄 , 古瀬 一隆 , 大保 信夫

    IPSJ SIG Notes 2007(54), 47, 2007-05-31

  • 長大な時系列データに対する部分時系列データの類似検索手法の提案  [in Japanese]

    石川 雅弘 , 陳 漢雄 , 古瀬 一隆 , 大保 信夫

    IPSJ SIG Notes 142, 47, 2007-05-31

  • Query Refinement Based on Global and Local Analysis  [in Japanese]

    CUI CHAOYUAN , CHEN HANXIONG , FURUSE KAZUTAKA , OHBO NOBUO

    Query Refinement is an effective information retrieval technique that interactively provides users with new keywords related to a particular query. Relevant keywords are generated by way of co-occuran …

    情報処理学会論文誌データベース(TOD) 45(SIG14(TOD24)), 54-63, 2004-12-15

    IPSJ  References (14)

  • Adaptive Time Warping  [in Japanese]

    OOMOMO SATOSHI , CHEN HANXIONG , FURUSE KAZUTAKA , OHBO NOBUO

    Recently, time series produced and treated in many fields, and fast similarity search in large time series databases becomes important. For this subject, similarity search techniques based on Euclidea …

    IPSJ SIG Notes 131(1), 491-498, 2003-07-16

    References (2)

  • Adaptive Time Warping  [in Japanese]

    OOMOMO Satoshi , CHEN Hanxiong , FURUSE Kazutaka , OHBO Nobuo

    Recently, time series produced and treated in many fields, and fast similarity search in large time series databases becomes important. For this subject, similarity search techniques based on Euclidea …

    IEICE technical report. Data engineering 103(191), 235-240, 2003-07-10

    References (2)

  • A Generalized Projected Clustering Method for Finding Clusters of Different Dimensionality  [in Japanese]

    FURUSE KAZUTAKA , ISHIKAWA MASAHIRO , CHEN HANXIONG , OHBO NOBUO

    This paper proposes a novel method of generalized projected clustering which is effective for high dimensional data. Although clustering is an important tool for various kinds of fields such as trend …

    情報処理学会論文誌データベース(TOD) 43(SIG02(TOD13)), 193-202, 2002-03-15

    IPSJ  References (12)

  • Dimensionality Reduction Technique with Convex Polyhedra and High - dimensional Index Structure  [in Japanese]

    AN JIYUAN , FURUSE KAZUTAKA , CHEN HANXIONG , ISHIKAWA MASAHIRO , OHBO NOBUO

    This paper proposes a new dimensionality reduction technique and an indexing mechanism for high dimensional data sets in which data points are not uniformly distributed. The proposed technique decompo …

    情報処理学会論文誌データベース(TOD) 43(SIG02(TOD13)), 168-178, 2002-03-15

    IPSJ  References (11)

  • Dimensionality Reduction Technique with Convex Polyhedra and High-Dimensional Index Structure  [in Japanese]

    AN Jiyuan , FURUSE Kazutaka , CHEN Hanxiong , ISHIKAWA Masahiro , OHBO Nobuo

    This paper proposes a new dimensionality reduction technique and an indexing mechanism for high dimensional data sets in which data points are not uniformly distributed and dimensions are interrelated …

    IPSJ SIG Notes 125(2), 115-122, 2001-07-19

    References (9) Cited by (1)

  • Dimensionality Reduction Technique with Convex Polyhedra and High-Dimensional Index Structure  [in Japanese]

    AN Jiyuan , FURUSE Kazutaka , CHEN Hanxiong , ISHIKAWA Masahiro , OHBO Nobuo

    This paper proposes a new dimensionality reduction technique and an indexing mechanism for high dimensional data sets in which data points are not uniformly distributed and dimensions are interrelated …

    IEICE technical report. Data engineering 101(193), 113-120, 2001-07-12

    References (9)

  • A metric index, MetricMatrix, and effectiveness of metric indices  [in Japanese]

    Ishikawa Masahiro , Chen Hanxiong , Furuse Kazutaka , Ohbo Nobuo

    We propose a metric index, named MetricMatrix, which supports efficient near neighbour searches in an arbitrary metric space. MetricMatrix is a memory-resident, static index. Its distinct feature is t …

    IPSJ SIG Notes 2001(44), 145-152, 2001-05-21

  • A metric index, MetricMatrix, and effectiveness of metric indices  [in Japanese]

    ISHIKAWA Masahiro , CHEN Hanxiong , FURUSE Kazutaka , OHBO Nobuo

    We propose a metric index, named MetricMatrix, which supports efficient near neighbour searches in an arbitrary metric space. MetricMatrix is a memory-resident, static index. Its distinct feature is t …

    IPSJ SIG Notes 124, 145-152, 2001-05-21

    References (6)

  • Mechanism and Evaluation of a Projected Clustering Algorithm with Stepwise Dimension Detection  [in Japanese]

    KUROKI Kaoru , FURUSE Kazutaka , OHBO Nobuo

    This paper proposes a new projected clustering algorithm for high dimensional data. The PROCLUS algorithm proposed in the literature has limitation for finding proper dimensions and medoids. In this p …

    IPSJ SIG Notes 123, 15-22, 2001-01-22

    References (9) Cited by (1)

  • Exploiting the Branch and Bound Technique for Document Similarity Search

    MIURA Takayuki , OHBO Nobuo , FURUSE Kazutaka

    This paper proposes a new mechanism for document similarity search, which uses the indexing structure called signature tables. The mechanism of signature tables is originally invented for similarity s …

    IEICE technical report. Data engineering 100(351), 79-86, 2000-10-06

    References (6)

  • マーケットバスケットデータに対する類似索引機構の文献データへの適用  [in Japanese]

    三浦 貴之 , 大保 信夫 , 古瀬 一隆

    第61回全国大会講演論文集 2000(1), 179-180, 2000-10-03

    IPSJ 

  • 次元の段階的なしぼり込みによる射影クラスタリング  [in Japanese]

    黒木 薫 , 大保 信夫 , 古瀬 一隆

    第61回全国大会講演論文集 2000(1), 69-70, 2000-10-03

    IPSJ 

  • Efficient MST construction for Complete Metric Graphs  [in Japanese]

    石川 雅弘 , 劉 奕 , 大保 信夫

    全国大会講演論文集 第59回(データベースとメディア), 111-112, 1999-09-28

    IPSJ 

  • A metric index MI-tree  [in Japanese]

    ISHIKAWA MASAHIRO , NOTOYA JUNICHI , CHEN HANXIONG , OHBO NOBUO

    距離の定義されたデータ空間における効率的な近傍探索を支援するための索引木 MI-tree(Metric Index Tree)を提案する.MI-treeは動的な更新およびディスクへの格納を考慮に入れたページ化された索引木であり 検索時の距離計算回数およびI/Oコストの削減を目的としている.MI-treeは距離空間中の点を一次元空間にマッピングし数値キーを割り当て そのキーによりB+treeを利用す …

    情報処理学会論文誌データベース(TOD) 40(SIG06(TOD3)), 104-114, 1999-08-15

    IPSJ  IPSJ  IR  References (10) Cited by (3)

  • Mining Coverages for Query Refinement  [in Japanese]

    LIU YE , CHEN HANXIONG , NOTOYA JUNICHI , OHBO NOBUO

    In this paper we present a query support model for document retrieval system by mining Association Rule between keywords from large document databases. The model is proposed to normalize the structure …

    情報処理学会論文誌データベース(TOD) 40(SIG03(TOD1)), 1-10, 1999-02-15

    IPSJ  IR  References (18)

  • 1 / 4
Page Top