| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2021-05-28 11:20 Orientation Estimation of Interests using Approximate Minimum Steiner Tree Urara Kobayashi, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.)  IN2021-4 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In recent years, there has been a tendency to represent information by graph according to services, and it attracts attention to estimate interests using graph space in the field of advertisement and product development. In particular, when we use non-property graphs whose edges do not have attributes, we have no choice but to use the distance for estimation, and if the estimation index is the distance between the vertex for browsed information (terminal) and the vertex for information that the user is interested in (vertex of interest), the index can reflect no more than the nearest terminal to the vertex of interest, so it is not possible to consider the uneven distribution of terminals in the graph. Therefore, the authors call the uneven distribution of the terminals in the graph the orientation and estimate interests in consideration of the orientation. Specifically complementary vertices (Steiner points) that reflect the uneven distribution of terminals are calculated using the approximate minimum Steiner tree, and the shortest distance between the terminal or Steiner points and the vertex of interest is calculated. It was clarified that the complement with the approximate minimum Steiner tree can reflect the uneven distribution of terminals, there is the strength of the orientation, and the method can take the orientation into account independent of the number of terminals. The evaluations using Amazon’s joint purchase graph show that when the terminal group diameter showing distribution (spread) of interest is 8, the rate of change of the shortest distance is about 0.93 times, and when it is 14, it is about 0.87 times. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | graph / interest / steiner tree / / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 121, no. 42, IN2021-4, pp. 19-24, May 2021. | |
| Paper # | IN2021-4 | |
| Date of Issue | 2021-05-20 (IN) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | IN2021-4 |
|
| Conference Information | |
| Committee | RCS IN NV |
| Conference Date | 2021-05-27 - 2021-05-28 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Ad-Hoc/Sensor Networks/MANET, Mobile Networks, M2M/IoT Communications, Wi-Fi, IEEE802.15(ZigBee) and others |
| Paper Information | |
| Registration To | IN |
| Conference Code | 2021-05-RCS-IN-NV |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Orientation Estimation of Interests using Approximate Minimum Steiner Tree |
| Sub Title (in English) | |
| Keyword(1) | graph |
| Keyword(2) | interest |
| Keyword(3) | steiner tree |
| Keyword(4) | |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Urara Kobayashi |
| 1st Author's Affiliation | Keio University (Keio Univ.) |
| 2nd Author's Name | Naoki Matsumoto |
| 2nd Author's Affiliation | Research Institute for Digital Media and Content, Keio University (Keio Univ.) |
| 3rd Author's Name | Kunitake Kaneko |
| 3rd Author's Affiliation | Keio University (Keio Univ.) |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2021-05-28 11:20:00 |
| Presentation Time | 25 minutes |
| Registration for | IN |
| Paper # | IN2021-4 |
| Volume (vol) | vol.121 |
| Number (no) | no.42 |
| Page | pp.19-24 |
| #Pages | 6 |
| Date of Issue | 2021-05-20 (IN) |
[Return to Top Page]