<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605468591</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100317.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150601xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-014-1343-4</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-014-1343-4</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Double-phase locality-sensitive hashing of neighborhood development for multi-relational data</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Ping Ling, Xiangsheng Rong, Yongquan Dong, Guosheng Hao]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Multi-relational (MR) data refer to the objects that involve multi-associated tables or a relational database, and they are widely used in diverse applications. In spite of rich achievements in concrete classification or regression tasks, a neighborhood development algorithm customized to MR data is still missing. The reason lies in the fact that MR data are high-dimensional and highly structured. To address these two difficulties, this paper presents a double-phase locality-sensitive hashing (DPLSH) algorithm to develop neighborhood for MR data. DPLSH consists of offline and online hashing schemas to draw and summarize local closeness information from each involved table. Based on the closeness information, three criteria of neighborhood development are proposed. DPLSH is encoded with parameterization heuristics to make the algorithm data adaptive and less costly. Extensive experiments indicate that for MR data, the quality of neighborhoods produced by DPLSH is better than its peers; besides, in common data environment, DPLSH also exhibits the competitive behaviors with the state of the art.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multi-relational data</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Neighborhood development</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Locality-sensitive hashing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Double-phase approach</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Parameterization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ling</subfield>
   <subfield code="D">Ping</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rong</subfield>
   <subfield code="D">Xiangsheng</subfield>
   <subfield code="u">Department of Training, Air Force Logistics of P. L. A, 221000, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dong</subfield>
   <subfield code="D">Yongquan</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Hao</subfield>
   <subfield code="D">Guosheng</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/6(2015-06-01), 1553-1565</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:6&lt;1553</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-014-1343-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00500-014-1343-4</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ling</subfield>
   <subfield code="D">Ping</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rong</subfield>
   <subfield code="D">Xiangsheng</subfield>
   <subfield code="u">Department of Training, Air Force Logistics of P. L. A, 221000, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dong</subfield>
   <subfield code="D">Yongquan</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Hao</subfield>
   <subfield code="D">Guosheng</subfield>
   <subfield code="u">College of Computer Science and Technology, Jiangsu Normal University, 221116, Xuzhou, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/6(2015-06-01), 1553-1565</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:6&lt;1553</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
