Neural Information Processing 27th International Conference ICONIP 2020 Bangkok Thailand November 23 27 2020 Proceedings Part III Haiqin Yang

Neural Information Processing 27th
International Conference ICONIP 2020

Bangkok Thailand November 23 27 2020
Proceedings Part III Haiqin Yang
Visit to download the full and correct content document:
https://textbookfull.com/product/neural-information-processing-27th-international-conf
erence-iconip-2020-bangkok-thailand-november-23-27-2020-proceedings-part-iii-haiq
in-yang/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Neural Information Processing 27th International

Conference ICONIP 2020 Bangkok Thailand November 23 27
2020 Proceedings Part I Haiqin Yang
https://textbookfull.com/product/neural-information-
processing-27th-international-conference-iconip-2020-bangkok-
thailand-november-23-27-2020-proceedings-part-i-haiqin-yang/

2020 Proceedings Part II Haiqin Yang
thailand-november-23-27-2020-proceedings-part-ii-haiqin-yang/

2020 Proceedings Part IV Haiqin Yang
thailand-november-18-22-2020-proceedings-part-iv-haiqin-yang/

2020 Proceedings Part V Haiqin Yang
thailand-november-18-22-2020-proceedings-part-v-haiqin-yang/
Neural Information Processing: 25th International
Conference, ICONIP 2018, Siem Reap, Cambodia, December
13–16, 2018, Proceedings, Part III Long Cheng
processing-25th-international-conference-iconip-2018-siem-reap-
cambodia-december-13-16-2018-proceedings-part-iii-long-cheng/
Blended Learning Education in a Smart Learning

Environment 13th International Conference ICBL 2020
Bangkok Thailand August 24 27 2020 Proceedings Simon K.
S. Cheung
https://textbookfull.com/product/blended-learning-education-in-a-
smart-learning-environment-13th-international-conference-
icbl-2020-bangkok-thailand-august-24-27-2020-proceedings-simon-k-
s-cheung/
Computer Networks 27th International Conference CN 2020

Gda■sk Poland June 23 24 2020 Proceedings Piotr Gaj
https://textbookfull.com/product/computer-networks-27th-
international-conference-cn-2020-gdansk-poland-
june-23-24-2020-proceedings-piotr-gaj/
Cooperative Design, Visualization, and Engineering:

17th International Conference, CDVE 2020, Bangkok,
Thailand, October 25–28, 2020, Proceedings Yuhua Luo
https://textbookfull.com/product/cooperative-design-
visualization-and-engineering-17th-international-conference-
cdve-2020-bangkok-thailand-october-25-28-2020-proceedings-yuhua-
luo/
Neural Information Processing: 24th International

Conference, ICONIP 2017, Guangzhou, China, November
14-18, 2017, Proceedings, Part II 1st Edition Derong
Liu Et Al. (Eds.)
processing-24th-international-conference-iconip-2017-guangzhou-
china-november-14-18-2017-proceedings-part-ii-1st-edition-derong-
Haiqin Yang · Kitsuchart Pasupa ·
Andrew Chi-Sing Leung · James T. Kwok ·
Jonathan H. Chan · Irwin King (Eds.)
LNCS 12534
Neural
Information Processing
27th International Conference, ICONIP 2020
Bangkok, Thailand, November 23–27, 2020
Proceedings, Part III
Lecture Notes in Computer Science 12534
Founding Editors
Gerhard Goos
Karlsruhe Institute of Technology, Karlsruhe, Germany
Juris Hartmanis
Cornell University, Ithaca, NY, USA
Editorial Board Members

Elisa Bertino
Purdue University, West Lafayette, IN, USA
Wen Gao
Peking University, Beijing, China
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Gerhard Woeginger
RWTH Aachen, Aachen, Germany
Moti Yung
Columbia University, New York, NY, USA
More information about this subseries at http://www.springer.com/series/7407
Haiqin Yang Kitsuchart Pasupa
• •
Andrew Chi-Sing Leung•
James T. Kwok Jonathan H. Chan

• •
Irwin King (Eds.)
Neural
Information Processing
27th International Conference, ICONIP 2020
Bangkok, Thailand, November 23–27, 2020
Proceedings, Part III
123
Editors
Haiqin Yang Kitsuchart Pasupa
Department of AI Faculty of Information Technology
Ping An Life King Mongkut's Institute
Shenzhen, China of Technology Ladkrabang
Bangkok, Thailand
Andrew Chi-Sing Leung
City University of Hong Kong James T. Kwok
Kowloon, Hong Kong Department of Computer Science
and Engineering
Jonathan H. Chan Hong Kong University of Science
School of Information Technology and Technology
King Mongkut’s University Hong Kong, Hong Kong
of Technology Thonburi
Bangkok, Thailand Irwin King
The Chinese University of Hong Kong
New Territories, Hong Kong
ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-030-63835-1 ISBN 978-3-030-63836-8 (eBook)
https://doi.org/10.1007/978-3-030-63836-8
LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues
© Springer Nature Switzerland AG 2020

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.
This Springer imprint is published by the registered company Springer Nature Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
This book is a part of the five-volume proceedings of the 27th International Conference
on Neural Information Processing (ICONIP 2020), held during November 18–22,
2020. The conference aims to provide a leading international forum for researchers,
scientists, and industry professionals who are working in neuroscience, neural net-
works, deep learning, and related fields to share their new ideas, progresses, and
achievements. Due to the outbreak of COVID-19, this year’s conference, which was
supposed to be held in Bangkok, Thailand, was organized as fully virtual conference.
The research program of this year’s edition consists of four main categories, Theory
and Algorithms, Computational and Cognitive Neurosciences, Human-Centered
Computing, and Applications, for refereed research papers with nine special sessions
and one workshop. The research tracks attracted submissions from 1,083 distinct
authors from 44 countries. All the submissions were rigorously reviewed by the con-
ference Program Committee (PC) comprising 84 senior PC members and 367 PC
members. A total of 1,351 reviews were provided, with each submission receiving at
least 2 reviews, and some papers receiving 3 or more reviews. This year, we also
provided rebuttals for authors to address the errors that exist in the review comments.
Meta-reviews were provided with consideration of both authors’ rebuttal and review-
ers’ comments. Finally, we accepted 187 (30.25%) of the 618 full papers that were sent
out for review in three volumes of Springer’s series of Lecture Notes in Computer
Science (LNCS) and 189 (30.58%) of the 618 in two volumes of Springer’s series of
Communications in Computer and Information Science (CCIS).
We would like to take this opportunity to thank all the authors for submitting their
papers to our conference, and the senior PC members, PC members, as well as all the
Organizing Committee members for their hard work. We hope you enjoyed the
research program at the conference.
November 2020 Haiqin Yang

Kitsuchart Pasupa
Organization
Honorary Chairs
Jonathan Chan King Mongkut’s University of Technology Thonburi,
Thailand
Irwin King Chinese University of Hong Kong, Hong Kong
General Chairs
Andrew Chi-Sing Leung City University of Hong Kong, Hong Kong
James T. Kwok Hong Kong University of Science and Technology,
Hong Kong
Program Chairs
Haiqin Yang Ping An Life, China
Kitsuchart Pasupa King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Local Arrangements Chair

Vithida King Mongkut University of Technology Thonburi,
Chongsuphajaisiddhi Thailand
Finance Chairs
Vajirasak Vanijja King Mongkut’s University of Technology Thonburi,
Thailand
Seiichi Ozawa Kobe University, Japan
Special Sessions Chairs

Kaizhu Huang Xi’an Jiaotong-Liverpool University, China
Raymond Chi-Wing Wong Hong Kong University of Science and Technology,
Hong Kong
Tutorial Chairs
Zenglin Xu Harbin Institute of Technology, China
Jing Li Hong Kong Polytechnic University, Hong Kong
viii Organization
Proceedings Chairs
Xinyi Le Shanghai Jiao Tong University, China
Jinchang Ren University of Strathclyde, UK
Publicity Chairs
Zeng-Guang Hou Chinese Academy of Sciences, China
Ricky Ka-Chun Wong City University of Hong Kong, Hong Kong
Senior Program Committee

Sabri Arik Istanbul University, Turkey
Davide Bacciu University of Pisa, Italy
Yi Cai South China University of Technology, China
Zehong Cao University of Tasmania, Australia
Thailand
Yi-Ping Phoebe Chen La Trobe University, Australia
Xiaojun Chen Shenzhen University, China
Wei Neng Chen South China University of Technology, China
Yiran Chen Duke University, USA
Yiu-ming Cheung Hong Kong Baptist University, Hong Kong
Sonya Coleman Ulster University, UK
Daoyi Dong University of New South Wales, Australia
Leonardo Franco University of Malaga, Spain
Jun Fu Northeastern University, China
Xin Geng Southeast University, China
Ping Guo Beijing Normal University, China
Pedro Antonio Gutiérrez Universidad de Córdoba, Spain
Wei He University of Science and Technology Beijing, China
Akira Hirose The University of Tokyo, Japan
Zengguang Hou Chinese Academy of Sciences, China
Kazushi Ikeda Nara Institute of Science and Technology, Japan
Gwanggil Jeon Incheon National University, South Korea
Min Jiang Xiamen University, China
Abbas Khosravi Deakin University, Australia
Wai Lam Chinese University of Hong Kong, Hong Kong
Chi Sing Leung City University of Hong Kong, Hong Kong
Kan Li Beijing Institute of Technology, China
Xi Li Zhejiang University, China
Jing Li Hong Kong Polytechnic University, Hong Kong
Shuai Li University of Cambridge, UK
Zhiyong Liu Chinese Academy of Sciences, China
Zhigang Liu Southwest Jiaotong University, China
Organization ix
Wei Liu Tencent, China

Jun Liu Xi’an Jiaotong University, China
Jiamou Liu The University of Auckland, New Zealand
Lingjia Liu Virginia Tech, USA
Jose A. Lozano UPV/EHU, Spain
Bao-liang Lu Shanghai Jiao Tong University, China
Jiancheng Lv Sichuan University, China
Marley M. B. R. Vellasco PUC of Rio de Janeiro, Brazil
Hiroshi Mamitsuka Kyoto University, Japan
Leandro Minku University of Birmingham, UK
Chaoxu Mu Tianjin University, China
Wolfgang Nejdl L3S Research Center, Germany
Quoc Viet Hung Nguyen Griffith University, Australia
Takashi Omori Tamagawa University, Japan
Seiichi Ozawa Kobe University, Japan
Weike Pan Shenzhen University, China
Jessie Ju Hyun Park Yeungnam University, Japan
Thailand
Abdul Rauf Research Institute of Sweden, Sweden
Imran Razzak Deakin University, Australia
Jinchang Ren University of Strathclyde, UK
Hayaru Shouno The University of Electro-Communications, Japan
Ponnuthurai Suganthan Nanyang Technological University, Singapore
Yang Tang East China University of Science and Technology,
China
Jiliang Tang Michigan State University, USA
Ivor Tsang University of Technology Sydney, Australia
Peerapon Vateekul Chulalongkorn University, Thailand
Brijesh Verma Central Queensland University, Australia
Li-Po Wang Nanyang Technological University, Singapore
Kok Wai Wong Murdoch University, Australia
Ka-Chun Wong City University of Hong Kong, Hong Kong
Raymond Chi-Wing Wong Hong Kong University of Science and Technology,
Hong Kong
Long Phil Xia Peking University, Shenzhen Graduate School, China
Xin Xin Beijing Institute of Technology, China
Guandong Xu University of Technology Sydney, Australia
Bo Xu Chinese Academy of Sciences, China
Zenglin Xu Harbin Institute of Technology, China
Rui Yan Peking University, China
Xiaoran Yan Indiana University Bloomington, USA
Qinmin Yang Zhejiang University, China
Zhirong Yang Norwegian University of Science and Technology,
Norway
x Organization
De-Nian Yang Academia Sinica, Taiwan

Zhigang Zeng Huazhong University of Science and Technology,
China
Jialin Zhang Chinese Academy of Sciences, China
Min Ling Zhang Southeast University, China
Kun Zhang Carnegie Mellon University, USA
Yongfeng Zhang Rutgers University, USA
Dongbin Zhao Chinese Academy of Sciences, China
Yicong Zhou University of Macau, Macau
Jianke Zhu Zhejiang University, China
Program Committee
Muideen Adegoke City University of Hong Kong, Hong Kong
Sheraz Ahmed German Research Center for Artificial Intelligence,
Germany
Shotaro Akaho National Institute of Advanced Industrial Science
and Technology, Japan
Sheeraz Akram University of Pittsburgh, USA
Abdulrazak Alhababi Universiti Malaysia Sarawak, Malaysia
Muhamad Erza Aminanto University of Indonesia, Indonesia
Marco Anisetti University of Milan, Italy
Sajid Anwar Institute of Management Sciences, Pakistan
Muhammad Awais COMSATS University Islamabad, Pakistan
Affan Baba University of Technology Sydney, Australia
Boris Bacic Auckland University of Technology, New Zealand
Mubasher Baig National University of Computer and Emerging
Sciences, Pakistan
Tao Ban National Information Security Research Center, Japan
Sang Woo Ban Dongguk University, South Korea
Kasun Bandara Monash University, Australia
David Bong Universiti Malaysia Sarawak, Malaysia
George Cabral Rural Federal University of Pernambuco, Brazil
Anne Canuto Federal University of Rio Grande do Norte, Brazil
Zehong Cao University of Tasmania, Australia
Thailand
Guoqing Chao Singapore Management University, Singapore
Hongxu Chen University of Technology Sydney, Australia
Ziran Chen Bohai University, China
Xiaofeng Chen Chongqing Jiaotong University, China
Xu Chen Shanghai Jiao Tong University, China
He Chen Hebei University of Technology, China
Junjie Chen Inner Mongolia University, China
Mulin Chen Northwestern Polytechnical University, China
Junying Chen South China University of Technology, China
Organization xi
Chuan Chen Sun Yat-sen University, China

Liang Chen Sun Yat-sen University, China
Zhuangbin Chen Chinese University of Hong Kong, Hong Kong
Junyi Chen City University of Hong Kong, Hong Kong
Xingjian Chen City University of Hong Kong, Hong Kong
Lisi Chen Hong Kong Baptist University, Hong Kong
Fan Chen Duke University, USA
Xiang Chen George Mason University, USA
Long Cheng Chinese Academy of Sciences, China
Aneesh Chivukula University of Technology Sydney, Australia
Sung Bae Cho Yonsei University, South Korea
Sonya Coleman Ulster University, UK
Fengyu Cong Dalian University of Technology, China
Jose Alfredo Ferreira Costa Federal University of Rio Grande do Norte, Brazil
Ruxandra Liana Costea Polytechnic University of Bucharest, Romania
Jean-Francois Couchot University of Franche-Comté, France
Raphaël Couturier University Bourgogne Franche-Comté, France
Zhenyu Cui University of the Chinese Academy of Sciences, China
Debasmit Das Qualcomm, USA
Justin Dauwels Nanyang Technological University, Singapore
Xiaodan Deng Beijing Normal University, China
Zhaohong Deng Jiangnan University, China
Mingcong Deng Tokyo University, Japan
Nat Dilokthanakul Vidyasirimedhi Institute of Science and Technology,
Thailand
Hai Dong RMIT University, Australia
Qiulei Dong Chinese Academy of Sciences, China
Shichao Dong Shenzhen Zhiyan Technology Co., Ltd., China
Kenji Doya Okinawa Institute of Science and Technology, Japan
Yiqun Duan University of Sydney, Australia
Aritra Dutta King Abdullah University of Science and Technology,
Saudi Arabia
Mark Elshaw Coventry University, UK
Issam Falih Paris 13 University, France
Ozlem Faydasicok Istanbul University, Turkey
Zunlei Feng Zhejiang University, China
Leonardo Franco University of Malaga, Spain
Fulvio Frati Università degli Studi di Milano, Italy
Chun Che Fung Murdoch University, Australia
Wai-Keung Fung Robert Gordon University, UK
Claudio Gallicchio University of Pisa, Italy
Yongsheng Gao Griffith University, Australia
Cuiyun Gao Harbin Institute of Technology, China
Hejia Gao University of Science and Technology Beijing, China
Yunjun Gao Zhejiang University, China
xii Organization
Xin Gao King Abdullah University of Science and Technology,

Saudi Arabia
Yuan Gao Uppsala University, Sweden
Yuejiao Gong South China University of Technology, China
Xiaotong Gu University of Tasmania, Australia
Shenshen Gu Shanghai University, China
Cheng Guo Chinese Academy of Sciences, China
Zhishan Guo University of Central Florida, USA
Akshansh Gupta Central Electronics Engineering Research Institute,
India
Pedro Antonio Gutiérrez University of Córdoba, Spain
Christophe Guyeux University Bourgogne Franche-Comté, France
Masafumi Hagiwara Keio University, Japan
Ali Haidar University of New South Wales, Australia
Ibrahim Hameed Norwegian University of Science and Technology,
Norway
Yiyan Han Huazhong University of Science and Technology,
China
Zhiwei Han Southwest Jiaotong University, China
Xiaoyun Han Sun Yat-sen University, China
Cheol Han Korea University, South Korea
Takako Hashimoto Chiba University of Commerce, Japan
Kun He Shenzhen University, China
Xing He Southwest University, China
Xiuyu He University of Science and Technology Beijing, China
Wei He University of Science and Technology Beijing, China
Katsuhiro Honda Osaka Prefecture University, Japan
Yao Hu Alibaba Group, China
Binbin Hu Ant Group, China
Jin Hu Chongqing Jiaotong University, China
Jinglu Hu Waseda University, Japan
Shuyue Hu National University of Singapore, Singapore
Qingbao Huang Guangxi University, China
He Huang Soochow University, China
Chih-chieh Hung National Chung Hsing University, Taiwan
Mohamed Ibn Khedher IRT SystemX, France
Kazushi Ikeda Nara Institute of Science and Technology, Japan
Teijiro Isokawa University of Hyogo, Japan
Fuad Jamour University of California, Riverside, USA
Jin-Tsong Jeng National Formosa University, Taiwan
Sungmoon Jeong Kyungpook National University, South Korea
Yizhang Jiang Jiangnan University, China
Wenhao Jiang Tencent, China
Yilun Jin Hong Kong University of Science and Technology,
Hong Kong
Organization xiii
Wei Jin Michigan State University, USA

Hamid Karimi Michigan State University, USA
Dermot Kerr Ulster University, UK
Tariq Khan Deakin University, Australia
Rhee Man Kil Korea Advanced Institute of Science and Technology,
South Korea
Sangwook Kim Kobe University, Japan
Sangwook Kim Kobe University, Japan
DaeEun Kim Yonsei University, South Korea
Jin Kyu Kim Facebook, Inc., USA
Mutsumi Kimura Ryukoku University, Japan
Yasuharu Koike Tokyo Institute of Technology, Japan
Ven Jyn Kok National University of Malaysia, Malaysia
Aneesh Krishna Curtin University, Australia
Shuichi Kurogi Kyushu Institute of Technology, Japan
Yoshimitsu Kuroki National Institute of Technology, Kurume College,
Japan
Susumu Kuroyanagi Nagoya Institute of Technology, Japan
Weng Kin Lai Tunku Abdul Rahman University College, Malaysia
Wai Lam Chinese University of Hong Kong, Hong Kong
Kittichai Lavangnananda King Mongkut’s University of Technology Thonburi,
Thailand
Xinyi Le Shanghai Jiao Tong University, China
Teerapong Leelanupab King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Man Fai Leung City University of Hong Kong, Hong Kong
Gang Li Deakin University, Australia
Qian Li University of Technology Sydney, Australia
Jing Li University of Technology Sydney, Australia
JiaHe Li Beijing Institute of Technology, China
Jian Li Huawei Noah’s Ark Lab, China
Xiangtao Li Jilin University, China
Tao Li Peking University, China
Chengdong Li Shandong Jianzhu University, China
Na Li Tencent, China
Baoquan Li Tianjin Polytechnic University, China
Yiming Li Tsinghua University, China
Yuankai Li University of Science and Technology of China, China
Yang Li Zhejiang University, China
Mengmeng Li Zhengzhou University, China
Yaxin Li Michigan State University, USA
Xiao Liang Nankai University, China
Hualou Liang Drexel University, USA
Hao Liao Shenzhen University, China
Ming Liao Chinese University of Hong Kong, Hong Kong
Alan Liew Griffith University, Australia
xiv Organization
Chengchuang Lin South China Normal University, China

Xinshi Lin Chinese University of Hong Kong, Hong Kong
Jiecong Lin City University of Hong Kong, Hong Kong
Shu Liu The Australian National University, Australia
Xinping Liu University of Tasmania, Australia
Shaowu Liu University of Technology Sydney, Australia
Weifeng Liu China University of Petroleum, China
Zhiyong Liu Chinese Academy of Sciences, China
Junhao Liu Chinese Academy of Sciences, China
Shenglan Liu Dalian University of Technology, China
Xin Liu Huaqiao University, China
Xiaoyang Liu Huazhong University of Science and Technology,
China
Weiqiang Liu Nanjing University of Aeronautics and Astronautics,
China
Qingshan Liu Southeast University, China
Wenqiang Liu Southwest Jiaotong University, China
Hongtao Liu Tianjin University, China
Yong Liu Zhejiang University, China
Linjing Liu City University of Hong Kong, Hong Kong
Zongying Liu King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Xiaorui Liu Michigan State University, USA
Huawen Liu The University of Texas at San Antonio, USA
Zhaoyang Liu Chinese Academy of Sciences, China
Sirasit Lochanachit King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Xuequan Lu Deakin University, Australia
Wenlian Lu Fudan University, China
Ju Lu Shandong University, China
Hongtao Lu Shanghai Jiao Tong University, China
Huayifu Lv Beijing Normal University, China
Qianli Ma South China University of Technology, China
Mohammed Mahmoud Beijing Institute of Technology, China
Rammohan Mallipeddi Kyungpook National University, South Korea
Jiachen Mao Duke University, USA
Ali Marjaninejad University of Southern California, USA
Sanparith Marukatat National Electronics and Computer Technology Center,
Thailand
Tomas Henrique Maul University of Nottingham Malaysia, Malaysia
Phayung Meesad King Mongkut’s University of Technology
North Bangkok, Thailand
Fozia Mehboob Research Institute of Sweden, Sweden
Wenjuan Mei University of Electronic Science and Technology
of China, China
Daisuke Miyamoto The University of Tokyo, Japan
Organization xv
Kazuteru Miyazaki National Institution for Academic Degrees and Quality

Enhancement of Higher Education, Japan
Bonaventure Molokwu University of Windsor, Canada
Hiromu Monai Ochanomizu University, Japan
J. Manuel Moreno Universitat Politècnica de Catalunya, Spain
Francisco J. Moreno-Barea University of Malaga, Spain
Chen Mou Nanjing University of Aeronautics and Astronautics,
China
Ahmed Muqeem Sheri National University of Sciences and Technology,
Pakistan
Usman Naseem University of Technology Sydney, Australia
Mehdi Neshat The University of Adelaide, Australia
Quoc Viet Hung Nguyen Griffith University, Australia
Thanh Toan Nguyen Griffith University, Australia
Dang Nguyen University of Canberra, Australia
Thanh Tam Nguyen Ecole Polytechnique Federale de Lausanne, France
Giang Nguyen Korea Advanced Institute of Science and Technology,
South Korea
Haruhiko Nishimura University of Hyogo, Japan
Stavros Ntalampiras University of Milan, Italy
Anupiya Nugaliyadde Murdoch University, Australia
Toshiaki Omori Kobe University, Japan
Yuangang Pan University of Technology Sydney, Australia
Weike Pan Shenzhen University, China
Teerapong Panboonyuen Chulalongkorn University, Thailand
Paul S. Pang Federal University Australia, Australia
Lie Meng Pang Southern University of Science and Technology, China
Hyeyoung Park Kyungpook National University, South Korea
Thailand
Yong Peng Hangzhou Dianzi University, China
Olutomilayo Petinrin City University of Hong Kong, Hong Kong
Geong Sen Poh National University of Singapore, Singapore
Mahardhika Pratama Nanyang Technological University, Singapore
Emanuele Principi Università Politecnica delle Marche, Italy
Yiyan Qi Xi’an Jiaotong University, China
Saifur Rahaman International Islamic University Chittagong,
Bangladesh
Muhammad Ramzan Saudi Electronic University, Saudi Arabia
Yazhou Ren University of Electronic Science and Technology
of China, China
Pengjie Ren University of Amsterdam, The Netherlands
Colin Samplawski University of Massachusetts Amherst, USA
Yu Sang Liaoning Technical University, China
Gerald Schaefer Loughborough University, UK
xvi Organization
Rafal Scherer Czestochowa University of Technology, Poland

Xiaohan Shan Chinese Academy of Sciences, China
Hong Shang Tencent, China
Nabin Sharma University of Technology Sydney, Australia
Zheyang Shen Aalto University, Finland
Yin Sheng Huazhong University of Science and Technology,
China
Jin Shi Nanjing University, China
Wen Shi South China University of Technology, China
Zhanglei Shi City University of Hong Kong, Hong Kong
Tomohiro Shibata Kyushu Institute of Technology, Japan
Hayaru Shouno The University of Electro-Communications, Japan
Chiranjibi Sitaula Deakin University, Australia
An Song South China University of Technology, China
mofei Song Southeast University, China
Liyan Song Southern University of Science and Technology, China
Linqi Song City University of Hong Kong, Hong Kong
Yuxin Su Chinese University of Hong Kong, Hong Kong
Jérémie Sublime Institut supérieur d’électronique de Paris, France
Tahira Sultana UTM Malaysia, Malaysia
Xiaoxuan Sun Beijing Normal University, China
Qiyu Sun East China University of Science and Technology,
China
Ning Sun Nankai University, China
Fuchun Sun Tsinghua University, China
Norikazu Takahashi Okayama University, Japan
Hiu-Hin Tam City University of Hong Kong, Hong Kong
Hakaru Tamukoh Kyushu Institute of Technology, Japan
Xiaoyang Tan Nanjing University of Aeronautics and Astronautics,
China
Ying Tan Peking University, China
Shing Chiang Tan Multimedia University, Malaysia
Choo Jun Tan Wawasan Open University, Malaysia
Gouhei Tanaka The University of Tokyo, Japan
Yang Tang East China University of Science and Technology,
China
Xiao-Yu Tang Zhejiang University, China
M. Tanveer Indian Institutes of Technology, India
Kai Meng Tay Universiti Malaysia Sarawak, Malaysia
Chee Siong Teh Universiti Malaysia Sarawak, Malaysia
Ya-Wen Teng Academia Sinica, Taiwan
Andrew Beng Jin Teoh Yonsei University, South Korea
Arit Thammano King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Eiji Uchino Yamaguchi University, Japan
Organization xvii
Nhi N.Y. Vo University of Technology Sydney, Australia

Hiroaki Wagatsuma Kyushu Institute of Technology, Japan
Nobuhiko Wagatsuma Tokyo Denki University, Japan
Yuanyu Wan Nanjing University, China
Feng Wan University of Macau, Macau
Dianhui Wang La Trobe University, Australia
Lei Wang Beihang University, China
Meng Wang Beijing Institute of Technology, China
Sheng Wang Henan University, China
Meng Wang Southeast University, China
Chang-Dong Wang Sun Yat-sen University, China
Qiufeng Wang Xi’an Jiaotong-Liverpool University, China
Zhenhua Wang Zhejiang University of Technology, China
Yue Wang Chinese University of Hong Kong, Hong Kong
Jiasen Wang City University of Hong Kong, Hong Kong
Jin Wang Hanyang University, South Korea
Wentao Wang Michigan State University, USA
Yiqi Wang Michigan State University, USA
Peerasak Wangsom CAT Telecom PCL, Thailand
Bunthit Watanapa King Mongkut’s University of Technology Thonburi,
Thailand
Qinglai Wei Chinese Academy of Sciences, China
Yimin Wen Guilin University of Electronic Technology, China
Guanghui Wen Southeast University, China
Ka-Chun Wong City University of Hong Kong, Hong Kong
Kuntpong Woraratpanya King Mongkut’s Institute of Technology Ladkrabang,
Thailand
Dongrui Wu Huazhong University of Science and Technology,
China
Qiujie Wu Huazhong University of Science and Technology,
China
Zhengguang Wu Zhejiang University, China
Weibin Wu Chinese University of Hong Kong, Hong Kong
Long Phil Xia Peking University, Shenzhen Graduate School, China
Tao Xiang Chongqing University, China
Jiaming Xu Chinese Academy of Sciences, China
Bin Xu Northwestern Polytechnical University, China
Qing Xu Tianjin University, China
Xingchen Xu Fermilab, USA
Hui Xue Southeast University, China
Nobuhiko Yamaguchi Saga University, Japan
Toshiyuki Yamane IBM Research, Japan
Xiaoran Yan Indiana University, USA
Shankai Yan National Institutes of Health, USA
Jinfu Yang Beijing University of Technology, China
Xu Yang Chinese Academy of Sciences, China
xviii Organization
Feidiao Yang Chinese Academy of Sciences, China

Minghao Yang Chinese Academy of Sciences, China
Jianyi Yang Nankai University, China
Xiaomin Yang Sichuan University, China
Shaofu Yang Southeast University, China
Yinghua Yao University of Technology Sydney, Australia
Jisung Yoon Indiana University, USA
Junichiro Yoshimoto Nara Institute of Science and Technology, Japan
Qi Yu University of New South Wales, Australia
Zhaoyuan Yu Nanjing Normal University, China
Wen Yu CINVESTAV-IPN, Mexico
Chun Yuan Tsinghua University, China
Xiaodong Yue Shanghai University, China
Li Yun Nanjing University of Posts and Telecommunications,
China
Jichuan Zeng Chinese University of Hong Kong, Hong Kong
Yilei Zhang Anhui Normal University, China
Yi Zhang Beijing Institute of Technology, China
Xin-Yue Zhang Chinese Academy of Sciences, China
Dehua Zhang Chinese Academy of Sciences, China
Lei Zhang Chongqing University, China
Jia Zhang Microsoft Research, China
Liqing Zhang Shanghai Jiao Tong University, China
Yu Zhang Southeast University, China
Liang Zhang Tencent, China
Tianlin Zhang University of Chinese Academy of Sciences, China
Rui Zhang Xi’an Jiaotong-Liverpool University, China
Jialiang Zhang Zhejiang University, China
Ziqi Zhang Zhejiang University, China
Jiani Zhang Chinese University of Hong Kong, Hong Kong
Shixiong Zhang City University of Hong Kong, Hong Kong
Jin Zhang Norwegian University of Science and Technology,
Norway
Jie Zhang Newcastle University, UK
Kun Zhang Carnegie Mellon University, USA
Yao Zhang Tianjin University, China
Yu Zhang University of Science and Technology Beijing, China
Zhijia Zhao Guangzhou University, China
Shenglin Zhao Tencent, China
Qiangfu Zhao University of Aizu, Japan
Xiangyu Zhao Michigan State University, USA
Xianglin Zheng University of Tasmania, Australia
Nenggan Zheng Zhejiang University, China
Wei-Long Zheng Harvard Medical School, USA
Guoqiang Zhong Ocean University of China, China
Organization xix
Jinghui Zhong South China University of Technology, China

Junping Zhong Southwest Jiaotong University, China
Xiaojun Zhou Central South University, China
Hao Zhou Harbin Engineering University, China
Yingjiang Zhou Nanjing University of Posts and Telecommunications,
China
Deyu Zhou Southeast University, China
Zili Zhou The University of Manchester, UK
Contents – Part III
Biomedical Information
Classification of Neuroblastoma Histopathological Images Using

Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Adhish Panta, Matloob Khushi, Usman Naseem, Paul Kennedy,
and Daniel Catchpoole
Data Mining ENCODE Data Predicts a Significant Role of SINA3

in Human Liver Cancer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
Matloob Khushi, Usman Naseem, Jonathan Du, Anis Khan,
and Simon K. Poon
Diabetic Retinopathy Detection Using Multi-layer Neural Networks

and Split Attention with Focal Loss. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
Usman Naseem, Matloob Khushi, Shah Khalid Khan, Nazar Waheed,
Adnan Mir, Atika Qazi, Bandar Alshammari, and Simon K. Poon
Enhancer-DSNet: A Supervisedly Prepared Enriched Sequence

Representation for the Identification of Enhancers and Their Strength . . . . . . 38
Muhammad Nabeel Asim, Muhammad Ali Ibrahim,
Muhammad Imran Malik, Andreas Dengel, and Sheraz Ahmed
Machine Learned Pulse Transit Time (MLPTT) Measurements from

Photoplethysmography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
Philip Mehrgardt, Matloob Khushi, Anusha Withana, and Simon Poon
Weight Aware Feature Enriched Biomedical Lexical Answer

Type Prediction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
Keqin Peng, Wenge Rong, Chen Li, Jiahao Hu, and Zhang Xiong
Neural Data Analysis
Decoding Olfactory Cognition: EEG Functional Modularity Analysis

Reveals Differences in Perception of Positively-Valenced Stimuli . . . . . . . . . 79
Nida Itrat Abbasi, Sony Saint-Auret, Junji Hamano,
Anumita Chaudhury, Anastasios Bezerianos, Nitish V. Thakor,
and Andrei Dragomir
Identifying Motor Imagery-Related Electroencephalogram Features During

Motor Execution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
Yuki Kokai, Isao Nambu, and Yasuhiro Wada
xxii Contents – Part III
Inter and Intra Individual Variations of Cortical Functional Boundaries

Depending on Brain States . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
Zhen Zhang, Junhai Xu, Luqi Cheng, Cheng Chen, and Lingzhong Fan
Phase Synchronization Indices for Classification of Action Intention

Understanding Based on EEG Signals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110
Xingliang Xiong, Xuesong Lu, Lingyun Gu, Hongfang Han, Zhongxian
Hong, and Haixian Wang
The Evaluation of Brain Age Prediction by Different Functional Brain

Network Construction Methods. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
Hongfang Han, Xingliang Xiong, Jianfeng Yan, Haixian Wang,
and Mengting Wei
Transfer Dataset in Image Segmentation Use Case . . . . . . . . . . . . . . . . . . . 135

Anna Wróblewska, Sylwia Sysko-Romańczuk, and Karol Prusinowski
Neural Network Models
A Gaussian Process-Based Incremental Neural Network

for Online Regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
Xiaoyu Wang, Lucian Gheorghe, and Jun-ichi Imura
Analysis on the Boltzmann Machine with Random Input Drifts

in Activation Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162
Wenhao Lu, Chi-Sing Leung, and John Sum
Are Deep Neural Architectures Losing Information? Invertibility

is Indispensable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172
Yang Liu, Zhenyue Qin, Saeed Anwar, Sabrina Caldwell,
and Tom Gedeon
Automatic Dropout for Deep Neural Networks . . . . . . . . . . . . . . . . . . . . . . 185

Veena Dodballapur, Rajanish Calisa, Yang Song, and Weidong Cai
Bayesian Randomly Wired Neural Network with Variational Inference

for Image Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
Pegah Tabarisaadi, Abbas Khosravi, and Saeid Nahavandi
Brain-Inspired Framework for Image Classification with a New

Unsupervised Matching Pursuit Encoding. . . . . . . . . . . . . . . . . . . . . . . . . . 208
Shiming Song, Chenxiang Ma, and Qiang Yu
Estimating Conditional Density of Missing Values Using Deep Gaussian

Mixture Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220
Marcin Przewięźlikowski, Marek Śmieja, and Łukasz Struski
Contents – Part III xxiii
Environmentally-Friendly Metrics for Evaluating the Performance of Deep

Learning Models and Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 232
Sorin Liviu Jurj, Flavius Opritoiu, and Mircea Vladutiu
Hybrid Deep Shallow Network for Assessment of Depression Using

Electroencephalogram Signals. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 245
Abdul Qayyum, Imran Razzak, and Wajid Mumtaz
Iterative Imputation of Missing Data Using Auto-Encoder Dynamics . . . . . . . 258

Marek Śmieja, Maciej Kołomycki, Łukasz Struski, Mateusz Juda,
and Mário A. T. Figueiredo
Multi-objective Evolution for Deep Neural Network Architecture Search . . . . 270

Petra Vidnerová and Roman Neruda
Neural Architecture Search for Extreme Multi-label Text Classification . . . . . 282

Loïc Pauletto, Massih-Reza Amini, Rohit Babbar, and Nicolas Winckler
Non-linear ICA Based on Cramer-Wold Metric. . . . . . . . . . . . . . . . . . . . . . 294

Przemysław Spurek, Aleksandra Nowak, Jacek Tabor, Łukasz Maziarka,
and Stanisław Jastrzębski
Oblique Random Forests on Residual Network Features. . . . . . . . . . . . . . . . 306

Wen Xin Cheng, P. N. Suganthan, and Rakesh Katuwal
P2ExNet: Patch-Based Prototype Explanation Network . . . . . . . . . . . . . . . . 318

Dominique Mercier, Andreas Dengel, and Sheraz Ahmed
Prediction of Taxi Demand Based on CNN-BiLSTM-Attention

Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
Xudong Guo
Pruning Long Short Term Memory Networks and Convolutional Neural

Networks for Music Emotion Recognition . . . . . . . . . . . . . . . . . . . . . . . . . 343
Madeline Brewer and Jessica Sharmin Rahman
Unsupervised Multi-layer Spiking Convolutional Neural Network Using

Layer-Wise Sparse Coding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 353
Regina Esi Turkson, Hong Qu, Yuchen Wang, and Moses J. Eghan
VAEPP: Variational Autoencoder with a Pull-Back Prior . . . . . . . . . . . . . . . 366

Wenxiao Chen, Wenda Liu, Zhenting Cai, Haowen Xu, and Dan Pei
Why Do Deep Neural Networks with Skip Connections and Concatenated

Hidden Representations Work? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 380
Oyebade K. Oyedotun and Djamila Aouada
xxiv Contents – Part III
Recommender Systems
AMBR: Boosting the Performance of Personalized Recommendation

via Learning from Multi-behavior Data . . . . . . . . . . . . . . . . . . . . . . . . . . . 395
Chen Wang, Shilu Lin, Zhicong Zhong, Yipeng Zhou, and Di Wu
Asymmetric Pairwise Preference Learning for Heterogeneous One-Class

Collaborative Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 407
Yongxin Ni, Zhuoxin Zhan, Weike Pan, and Zhong Ming
DPR-Geo: A POI Recommendation Model Using Deep Neural Network

and Geographical Influence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 420
Jun Zeng, Haoran Tang, and Junhao Wen
Feature Aware and Bilinear Feature Equal Interaction Network

for Click-Through Rate Prediction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 432
Lang Luo, Yufei Chen, Xianhui Liu, and Qiujun Deng
GFEN: Graph Feature Extract Network for Click-Through Rate Prediction . . . 444
Mei Yu, Chengchang Zhen, Ruiguo Yu, Xuewei Li, Tianyi Xu,
Mankun Zhao, Hongwei Liu, Jian Yu, and Xuyuan Dong
JUST-BPR: Identify Implicit Friends with Jump and Stay

for Social Recommendation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 455
Runsheng Wang, Min Gao, Junwei Zhang, and Quanwu Zhao
Leveraging Knowledge Context Information to Enhance

Personalized Recommendation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467
Jiong Wang, Yingshuai Kou, Yifei Zhang, Neng Gao, and ChenYang Tu
LHRM: A LBS Based Heterogeneous Relations Model for User Cold Start
Recommendation in Online Travel Platform . . . . . . . . . . . . . . . . . . . . . . . . 479
Ziyi Wang, Wendong Xiao, Yu Li, Zulong Chen, and Zhi Jiang
Match4Rec: A Novel Recommendation Algorithm Based on Bidirectional

Encoder Representation with the Matching Task . . . . . . . . . . . . . . . . . . . . . 491
Lingxiao Zhang, Jiangpeng Yan, Yujiu Yang, and Li Xiu
Multi-level Feature Extraction in Time-Weighted Graphical

Session-Based Recommendation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 504
Mei Yu, Suiwu Li, Ruiguo Yu, Xuewei Li, Tianyi Xu, Mankun Zhao,
Hongwei Liu, and Jian Yu
Time Series Analysis
3ETS+RD-LSTM: A New Hybrid Model for Electrical Energy

Consumption Forecasting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
Grzegorz Dudek, Paweł Pełka, and Slawek Smyl
Contents – Part III xxv
A Deep Time Series Forecasting Method Integrated with Local-Context

Sensitive Features . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 532
Tianyi Chen, Canghong Jin, Tengran Dong, and Dongkai Chen
Benchmarking Adversarial Attacks and Defenses for Time-Series Data . . . . . 544

Shoaib Ahmed Siddiqui, Andreas Dengel, and Sheraz Ahmed
Correlation-Aware Change-Point Detection via Graph Neural Networks . . . . . 555

Ruohong Zhang, Yu Hao, Donghan Yu, Wei-Cheng Chang, Guokun Lai,
and Yiming Yang
DPAST-RNN: A Dual-Phase Attention-Based Recurrent Neural Network

Using Spatiotemporal LSTMs for Time Series Prediction . . . . . . . . . . . . . . . 568
Shajia Shan, Ziyu Shen, Bin Xia, Zheng Liu, and Yun Li
ForecastNet: A Time-Variant Deep Feed-Forward Neural Network

Architecture for Multi-step-Ahead Time-Series Forecasting. . . . . . . . . . . . . . 579
Joel Janek Dabrowski, YiFan Zhang, and Ashfaqur Rahman
Memetic Genetic Algorithms for Time Series Compression by Piecewise

Linear Approximation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 592
Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski,
Manuel Rizzo, and Arthur Zahn
Sensor Drift Compensation Using Robust Classification Method . . . . . . . . . . 605

Guopei Wu, Junxiu Liu, Yuling Luo, and Senhui Qiu
SpringNet: Transformer and Spring DTW for Time Series Forecasting. . . . . . 616
Yang Lin, Irena Koprinska, and Mashud Rana
U-Sleep: A Deep Neural Network for Automated Detection of Sleep

Arousals Using Multiple PSGs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 629
Shenglan Yang, Bijue Jia, Yao Chen, Zhan ao Huang, Xiaoming Huang,
and Jiancheng Lv
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 641

Biomedical Information
Classification of Neuroblastoma
Histopathological Images Using
Machine Learning
Adhish Panta1 , Matloob Khushi1(B) , Usman Naseem1 , Paul Kennedy3 ,

and Daniel Catchpoole2,3(B)
1
School of Computer Science, The University of Sydney,
Camperdown, NSW 2006, Australia
matloob.khushi@sydney.edu.au
2
Children’s Cancer Research Unit, The Children’s Hospital at Westmead,
Westmead, NSW, Australia
daniel.catchpoole@health.nsw.gov.au
3
School of Computer Science, UTS, Sydney, Australia
Abstract. Neuroblastoma is the most common cancer in young children

accounting for over 15% of deaths in children due to cancer. Identification
of the class of neuroblastoma is dependent on histopathological classifica-
tion performed by pathologists which are considered the gold standard.
However, due to the heterogeneous nature of neuroblast tumours, the
human eye can miss critical visual features in histopathology. Hence, the
use of computer-based models can assist pathologists in classification
through mathematical analysis. There is no publicly available dataset
containing neuroblastoma histopathological images. So, this study uses
dataset gathered from The Tumour Bank at Kids Research at The Chil-
dren’s Hospital at Westmead, which has been used in previous research.
Previous work on this dataset has shown maximum accuracy of 84%. One
main issue that previous research fails to address is the class imbalance
problem that exists in the dataset as one class represents over 50% of
the samples. This study explores a range of feature extraction and data
undersampling and over-sampling techniques to improve classification
accuracy. Using these methods, this study was able to achieve accuracy
of over 90% in the dataset. Moreover, significant improvements observed
in this study were in the minority classes where previous work failed to
achieve high level of classification accuracy. In doing so, this study shows
importance of effective management of available data for any application
of machine learning.
1 Introduction
Neuroblastoma is the most common cancer diagnosed in children in the first year
of life and accounts for nearly 15% of deaths in children due to cancer [1,2]. Neu-
roblast tumours evolve from immature neuroblasts in the sympathetic nervous
system during the embryonic, fetal or postnatal stage in children. The disease
c Springer Nature Switzerland AG 2020
H. Yang et al. (Eds.): ICONIP 2020, LNCS 12534, pp. 3–14, 2020.
https://doi.org/10.1007/978-3-030-63836-8_1
4 A. Panta et al.
spreads typically through bone, bone marrow and the liver, and the tumour
can be spotted as mass lesions in areas like neck, chest, abdomen and pelvis
[1,2]. Cellular heterogeneity is one of the distinctive features of neuroblastoma
[3]. As a result of this feature, neuroblastic tumours show unexpected clinical
behaviour, which includes spontaneous regression and aggressive progression. As
such, it is common to see genetic materials achieve gains and loss rapidly when
neuroblastoma is evolving.
Pathologists use the Shimada system to classify whether a tumour is
favourable or unfavourable, which is considered the gold standard in neuroblas-
toma classification [3]. The Shimada system considers three key factors, which
are: age of the patient, the category of the Neuroblast tumour and the Mitosis-
Karyorrhexis index (MKI) [3]. To categorise neuroblast tumours, pathologists
examine thin tissues using optical microscopes in different magnifications. While
identifying the category of tumours, pathologists use several morphological fea-
tures such as the presence of neuropil, cellularity, nuclear size and shape [3]. How-
ever, due to the complex and heterogeneous nature of neuroblastoma, pathol-
ogists can get misleading results. The use of machine learning techniques for
feature extraction can reveal information and relationships not visible to the
human eye. Moreover, the use of Computer-Aided Design (CAD) systems in the
health sector offer benefits such as improvement of the overall speed and qual-
ity of the diagnosis process by eliminating human fatigue, acting as a tool for
the second opinion and assisting with the shortage of medical experts [3]. These
benefits are especially significant for neuroblastoma as the age of a patient at
the time of diagnosis is vital for the prognosis outcome.
There is a lack of significant exploration of the use of machine learning tech-
niques in for classification of Nuroblastoma types. One of the recent work was
done by S. Gheisari et al. [5–7] who classified neuroblastoma histopathological
images into five categories which were: undifferentiated neuroblastoma, gan-
glioneuroblastoma, ganglioneuroma, poorly-differentiated neuroblastoma, and
differentiating neuroblastoma. A range of low level and high-level feature extrac-
tion techniques were used in previous research to achieve accuracy of around 84%.
From a medical perspective, more accurate results would be desirable to increase
confidence and improve the chances of computer-based systems being used to
assist experts. Furthermore, [5–7] also identified that there was a high degree of
misclassification between poorly-differentiated and differentiating neuroblastoma
classes. From a biological perspective, these misclassifications are significant as
they can result in patients being overtreated or undertreated. Hence there is
keen interest in improving existing methods.
This paper aims to improve the previous work performed by S. Gheisari
et al. [5–7], where neuroblastoma images were successfully classified into five
categories. The dataset used for this work is the same as used in [5–7] which was
gathered from The Tumour Bank at Kids Research at The Children’s Hospital
at Westmead. Through the exploration of previously used feature extraction
methods and existing data optimisation techniques, this study aims to improve
the overall accuracy metrics achieved in previous neuroblastoma research. The
contributions made by this study is summarised below:
Classifying Neuroblastoma Images 5
1. Explored the impact of different feature extraction and machine learning tech-
niques on the performance for classification of neuroblastoma histopatholog-
ical images.
2. Evaluated the effects of combining outcomes from different feature extraction
techniques on performance metrics.
3. Explored the effects of data engineering techniques such as resampling the
given dataset on the overall performance.
4. Improved overall accuracy metrics through the use of these techniques
The rest of the paper is as follows: Sect. 2 discusses the methodology used.
Section 3 shows the results. Section 4 presents the discussion and Sect. 5 provides
a conclusion.
2 Methodology
To effectively conduct the intended research, this work follows a structure com-
monly used for the application of machine learning in the medical informatics
domain. The first step involves relevant data needs to be collected, or exist-
ing dataset needs to be selected to conduct the experiments. Collecting medical
image is a complex process which involves taking tissue samples from high resolu-
tion microscopes. It would also require expert medical professionals to categorize
the data so that models can be trained. So, the collection of raw data was con-
sidered out of scope, and an existing neuroblastoma dataset was used to conduct
the experiments. The next step involves feature engineering, where the aim is to
extract relevant features from available image data. Multiple feature and data
engineering techniques are explored in work conducted. Then machine learning
classification algorithms are implemented for classification. In this study, SVM
classification is used for uniform comparison as a greater focus on the feature
extraction and data engineering methods. Finally, the designed models are tested
and evaluated using 5-fold cross-validation, accuracy, precision, recall and F-1
score.
2.1 Dataset
The dataset used for this study is the same as used by S. Gheisari et al. in [5–7].
The dataset was gathered from The Tumour Bank at Kids Research at The Chil-
dren’s Hospital at Westmead and is the most comprehensive available dataset
for research in neuroblastoma. There is no publicly available dataset for neu-
roblastoma research, so the authors granted access to this dataset. The dataset
contains 1043 images gathered from stained tissue biopsy slides of 125 patients.
The tissue slides were scanned by using a software called Imagescope under 40x
magnification. Each image was cropped to include 300 by 300 pixels to provide
a balance between achieving a reasonable computational time and preserving
critical information in each image. It was also ensured that each cropped image
contained areas that best represent each category of neuroblastoma. This is a
6 A. Panta et al.
slight limitation of the dataset because it does not directly mimic a real-world
scenario where data can have noise points. Expert pathologists classified images
in the dataset according to the Shimada System where the categories included:
poorly differentiated neuroblastoma, differentiating neuroblastoma, undifferen-
tiating neuroblastoma, ganglioneuroma and ganglioneuroblastoma.
Fig. 1. Example of intra-class variance in neuroblastoma
As discussed previously, neuroblastoma has a high degree of intra-class vari-

ance. The extent of intra-class variance in the available dataset can be seen in
Fig. 1. Both (a) and (b) in the figure belong to the same class of neuroblastoma
(differentiating neuroblastoma). However, as the blue circled section in the image
indicates, they have neuroblast cells of differing sizes. This is a prominent fea-
ture of neuroblast tumours and has been extensively captured in the dataset.
The overall dataset used for the experimental setup can be summarised in Table
1. The table shows data distribution for each class and the number of patients
from whom the images were gathered. It can be seen that overall, there are 1043
data samples from 125 patients. It can also be seen that there is a high degree of
imbalance in the used dataset. The most common class is poorly-differentiated
neuroblastoma as it represents over 50% of the data with 571 samples. For the
least common class (ganglioneuroblastoma), there are only 46 samples available
which represents less than 5% of the dataset and is gathered from 8 out of 125
patients.
2.2 Experimental Setup

The study explored a range of experimental approaches around feature extrac-
tion and data undersampling and oversampling to determine the effects they
have in the given dataset. These experimental setups are explained below. To
evaluate the setups, k-fold stratified k-fold cross validation was used. A stratified
k-fold cross validation ensures that for each split in k, the original distribution
of dataset is maintained. Accuracy, precision, recall and F1-score were used as
Another random document with
no related content on Scribd:
V
Le 29 août [1841, à Paris]. [46] — Vous voulez que j’écrive mes

impressions, que je revienne à l’habitude de retracer mes journées :
pensée tardive, mon ami, et néanmoins écoutée. Le voilà ce
mémorandum désiré, ce de moi à vous dans le monde, comme vous
l’avez eu au Cayla : charmante ligne d’intimité, sentier des bois,
mené jusque dans Paris. Mais je n’irai pas loin dans le peu de jours
qui me restent ; rien que huit jours et le départ au bout. Ce point de
vue final m’attriste immensément, et je ne sais voir autre chose.
Comme le navigateur au terme de la mer Vermeille, je ne puis m’ôter
de là. O ma traversée de six mois, si étrange, si diverse, si belle et
triste, si dans l’inconnu, qui m’a tant accrue d’idées, de vues, de
choses nouvelles qui ont laissé tant à dire et à décrire ! Mais je n’ai
pas tenu de journal. Qui devait le lire ? Que penser à faire si
quelqu’un ne se plaît à ce que l’on fait ? Sans cet intérêt ma pensée
n’est qu’une glace sans tain. Du temps de Maurice, je réfléchissais
toutes choses ; c’était par lui, associé à mon intelligence, frère et ami
de toutes mes pensées. Un signe de désir, un mot de dilection,
suffisaient pour me faire écrire à torrents. Qu’il était influent sur moi
et que l’influence était belle ! Je ne sais à quoi la comparer : au vin
de Xérès, qui vivifie, exalte, sans enivrer.
[46] Cahier déjà imprimé dans les Reliquiæ, 1855.
Ce soir, je me retrouve un peu sous ces impressions que je

croyais perdues ; mais, je vous l’ai dit, je ne saurais parler que du
malade, pauvre jeune homme qui ne se doute pas de l’intérêt qu’il
m’inspire et du mal qu’il me fait en toussant. O vision si triste et si
chère ! D’où vient cela, d’où vient qu’il est des souffrances qu’on
aime ? dites, Jules, vous qui expliquez tant de choses à mon gré. Le
grand M. de vis-à-vis vous a trouvé bien aimable ; vous étiez en
verve ce soir, mais, plus ou moins, votre conversation abonde
d’esprit, d’éclat, de mouvement. Elle monte, s’étend, se joue dans
mille formes, sous une forme inattendue, magnifique feu d’artifice.
« Le beau parleur ! » a dit ce grand monsieur, en saluant la Baronne
qui a confirmé d’un sourire, ajoutant : « Ne croyez pas qu’il pense
tout ce qu’il dit. » C’était sans doute au sujet de saint Paul, et pour
écarter le soupçon d’hérésie que vous avez encouru en discourant
mondainement sur cet apôtre. Que je voudrais aussi ne pas vous
croire ! Bonne nuit ; je vais dormir, je vais chercher mes songes gris
de perle. Et à propos, pourquoi a-t-on ri lorsque j’ai comparé les
vôtres au son de la trompette ? Il y a donc là-dessous quelque
signification singulière, de ces sous-entendus de langage que je
n’entends pas ? Ce qui m’arrive souvent. On donne dans le monde
de doubles sens aux choses les plus simples, et qui n’est pas averti
s’y trompe. Quand je vois rire, allons, je suis au piége ; cela me
donne à penser, mais rien qu’un moment par surprise. A quoi bon
s’arrêter sur des complications ?
La charmante m’a dit : Nous causerons demain. Ce qui promet
d’intimes confidences. Quand les sources d’émotions ont coulé,
quand le cœur est plein, c’est sa façon d’en annoncer l’ouverture.
Nous causerons demain. Nous nous embrassons là-dessus.
Chacune va à son sommeil et je ne sais si on attend le jour pour
causer. Une tête agitée fait bien des révélations à son oreiller.
1er septembre ou dernier août, je ne sais ni ne m’informe du jour.

— Ce vague de date me plaît comme tout ce qui n’est pas précisé
par le temps. Je n’aime l’arrêté qu’en matière de foi, le positif qu’en
fait de sentiments : deux choses rares dans le monde. Mais il n’a
rien de ce que je voudrais. Je le quitte aussi sans en avoir reçu
d’influence, ne l’ayant pas aimé, et je m’en glorifie. Je crois que j’y
perdrais, que ma nature est de meilleur ordre restant ce qu’elle est,
sans mélange. Seulement j’acquerrais quelques agréments qui ne
viennent peut-être qu’aux dépens du fond. Tant d’habileté, de
finesse, de chatterie, de souplesse, ne s’obtiennent pas sans
préjudice. Sans leur sacrifier, point de grâces. Et néanmoins je les
aime, j’aime tout ce qui est élégance, bon goût, belles et nobles
manières. Je m’enchante aux conversations distinguées et sérieuses
des hommes, comme aux causeries, perles fines des femmes, à ce
jeu si joli, si délicat de leurs lèvres dont je n’avais pas idée. C’est
charmant, oui, c’est charmant, en vérité (chanson), pour qui se
prend aux apparences ; mais je ne m’en contente pas. Le moyen de
s’en contenter quand on tient à la valeur morale des choses ? Ceci
dit dans le sens de faire vie dans le monde, d’en tirer du bonheur, d’y
fonder des espérances sérieuses, d’y croire à quelque chose. Mmes
de *** sont venues ; je les ai crues longtemps amies, à entendre
leurs paroles expansives, leur mutuel témoignage d’intérêt, et ce
délicieux ma chère de Paris ; oui, c’est à les croire amies, et c’est
vrai tant qu’elles sont en présence, mais au départ, on dirait que
chacune a laissé sa caricature à l’autre. Plaisantes liaisons ! mais il
en existe d’autres, heureusement pour moi.
… Ce que je ne comprends pas dans cette femme, c’est qu’elle
ait pu s’attacher à ce Mirabeau que vous nous avez dépeint. Mais
l’a-t-elle cru ce qu’il est ou est-il bien ce qu’on en dit ? Le monde est
si méchant, on s’y plaît tant à faire des monstruosités ! Il y a aussi de
véritables monstres d’hommes. Quoi qu’il en soit du docteur
irlandais, il ne voit pas un malade en danger qu’il ne lui parle d’un
prêtre, et il est lui-même exact observateur des lois de l’Église.
Accordez cela avec sa réputation. Pourquoi encore, avec tant
d’audace, paraît-il timide et embarrassé devant nous trois, comme
M. William ? Il rougit autant et son regard rentre encore plus vite.
Est-ce là ce fougueux Jupiter [47] ? Je n’y connais rien peut-être :
oui, l’énigme du monde est obscure pour moi. Que d’insolubles
choses, que de complications ! Quand mon esprit a passé par là,
quand j’ai longé ces forêts de conversations sans trouée, sans issue,
je me retire avec tristesse, et j’appelle à moi les pensées religieuses
sans lesquelles je ne vois pas où reposer la tête.
[47] Un peu plus tard, il m’est venu des idées plus
étendues sur cet homme très peu connu, profond et
fermé.
(Note du Ms.)
Qu’alliez-vous faire dimanche à Saint-Roch ? Était-ce aussi pour

vous y reposer ? On a fait bien des investigations là-dessus. Peine
perdue. Que découvrir sur l’incompréhensible ? Dieu seul vous
connaît. Oui, vous êtes un palais labyrinthe, un dérouteur, et, sans
ce côté qui vous liait à Maurice, et où luit pour moi la lumière dans
les ténèbres, je ne vous connaîtrais pas non plus ; vous me feriez
peur. Et cependant vous avez l’âme belle et bonne, honnête,
dévouée, fidèle jusqu’à la mort, une vraie trempe de chevalier, et ce
n’est pas seulement au dedans.
Le 3. — J’ai commencé Delphine, ce roman si intéressant, dit-on.

Mais les romans ne m’intéressent guère, jamais ils ne m’ont moins
touchée. Est-ce par vue du monde et du fond qui les produit, ou par
étrangeté de cœur ou par goût de meilleures choses ? Je ne sais,
mais je ne puis me plaire au train désordonné des passions. Il y a
dans cet emportement quelque chose qui m’épouvante comme les
transports du délire. J’ai peur, horriblement peur de la folie, et ce
dérangement moral qui fait le roman en détruit le charme pour moi.
Je ne puis toucher ces livres que comme à des insensés, même
l’Amour impossible. De tous les romanciers, je ne goûte que Scott. Il
se met, par sa façon, à l’écart des autres et bien au-dessus. C’est un
homme de génie et peut-être le plus complet, et toujours pur. On
peut l’ouvrir au hasard, sans qu’un mot corrupteur étonne le regard
(Lamartine). L’amour, chez lui, c’est un fil de soie blanche dont il lie
ses drames. Delphine ne me paraît pas de ce genre. Le peu que j’ai
vu présage mal, et j’y trouve un genre perfide : c’est de parler vertu,
c’est de la mener sur le champ de bataille en épaulettes de capitaine
pour lui tirer, sous les yeux de Dieu, toutes les flèches de Cupidon.
Mme de Staël ne cesse de faire mal et de prêcher bien. Que je
déteste ces femmes en chaire et avec des passions béantes ! Cela
se voit dans les romans, et on dit aussi dans le monde : le grand
roman ! On m’en ouvre chaque jour quelques pages. Étranges
connaissances ! Est-ce bon ? Peut-être pour l’étendue des idées,
pour l’intelligence des choses. J’observe sans attrait, sans me lier à
rien, et cette indépendance d’esprit préserve de mauvaise atteinte.
Journée variée comme la température, ciel de salon, gris et bleu,
traversé de vapeurs brillantes. Ces teintes de la vie, qui les pourrait
peindre ? Ce serait un joli tableau et que je donnerais à faire à M.
William, l’artiste idéal. Je lui crois beaucoup de rêverie dans l’âme, et
l’amour passionné du beau, une nature tendre, ardente, élevée, qui
présage l’homme de marque. J’apprécie fort M. William sur ce que je
vois et sur ce que vous dites, vous, le jugeur. Mais surtout j’aime
cette candeur de cœur que vous dites encore d’un charme si rare
dans le monde. Vous l’aviez trouvée aussi à Maurice. Tout me
ramène à lui, je lui fais application de toute belle chose. Combien je
regrette que M. William ne l’ait pas connu et qu’il n’ait pas fait son
portrait ! Nous y perdons trop. Quelle ressemblance ! comme ce
beau talent eût saisi cette belle tête !
Je reviens de la rue Cherche-Midi, mon chemin d’angoisses.
Hélas ! que cette maison indienne m’est triste, et cependant il y a
quelque chose qui fait que j’y vais : il y a sa femme, toute couverte à
mes yeux de ce nom. Plus rien à dire.
Soirée musicale, artiste italien, grands chants et chansonnettes,
le tout d’heureux effet sur ma chère malade, qui est, au demeurant,
facilement contente. Aussi je me méfie un peu de ses jugements, qui
ne sont que des sensations bienveillantes. Elle perçoit par le cœur,
et cette transposition de facultés…
Le 8. — Il est mort, le jeune malade, hier soir à onze heures. Il

est mort ! Je savais qu’il allait mourir ; j’avais toujours cette pensée
devant moi comme un fantôme, et me voilà interdite. Oh ! toujours la
mort nous étonne, et celle-ci soulève en moi tant de souvenirs
accablants ! Le genre de maladie, cette belle tête, les détails que j’ai
recueillis sur sa bonté, sa douceur, son attrayant, ce je ne sais quoi
de certaines natures à magnétiser tout le monde, l’affection de son
valet de chambre, sa fin chrétienne et pieuse : tout cela est d’une
ressemblance touchante. Je voudrais être la sœur de Charité qui a
reçu son dernier soupir. Que de fois j’ai rêvé d’être sœur de Charité,
pour me trouver auprès des mourants qui n’ont ni sœur ni famille !
Leur tenir lieu de ce qui leur manque d’aimant, soigner leurs
souffrances et tourner leur âme à Dieu, oh ! la belle vocation de
femme ! J’ai souvent envié celle-là. Mais ni celle-là ni une autre :
toutes seront manquées. Il manque beaucoup de ne se vouer à rien.
Il semble que le bonheur soit dans l’indépendance, et c’est le
contraire.
Le 10. — On a renvoyé Delphine, avant que je l’aie achevé de

lire. Je n’en suis pas fâchée. Les livres, c’est cependant ma passion
intellectuelle ; mais qu’il en est peu de mon goût, ou que j’en connais
peu ! Ainsi des personnes. On n’en rencontre que bien rarement qui
vous plaisent. Vous et Maurice êtes toujours mes préférés. Je vous
vois au-dessus de tout ce que je vois. Vous êtes les deux hommes
qui me contentez le plus pleinement l’esprit. Oh ! s’il ne vous
manquait une chose ! et qu’en cela je souffre et souvent ! Chaque
fois qu’il en est question, on fait après votre départ le relevé de vos
principes et de vos paroles avec un blâme d’autant plus pénible que
je ne puis pas l’écarter. Bien loin de là, je le donne dans ma
conscience. La conscience agit souvent à contre-cœur. Non, je ne
puis entendre des choses qui lui font mal et qui vous font tort. J’ai
entendu quelqu’un vous traiter de fou à ce sujet. Vous vous
aventurez, dit-on, étrangement dans les questions religieuses. Je ne
vous les vois pas aborder que je n’éprouve les transes de cette mère
d’un fils aveugle, lancé sur l’Océan. Pardon de la comparaison, mon
cher Jules, je la reprends. Certes, vous ne manquez pas de vue,
hormis de celle de la foi.
Le 16. — Rien que la date. J’écrirai demain. Cœur triste ce soir

et tête lasse.
Le 17. — Ce que j’aurais dit hier, je ne le dis pas aujourd’hui. Je
vous ai vu, nous avons causé, cela suffit au dégagement du cœur, à
la délivrance de la tête, ce poids fatigant de sentiments et de
pensées que nul autre que vous ne pouvait recevoir. Me voilà
soulagée, mais je souffre de ce que j’ai mis au jour.
… O fin de tout ! fin de toutes choses et toujours des plus chères,
et sans cause connue souvent pour les sentiments du cœur, que par
je ne sais quel dissolvant qui s’y mêle. En s’unissant, il entre le grain
de séparation. Cruelle déception pour qui croyait aux affections
éternelles ! Oh ! que j’apprends ! mais la science est amère.
… Qui me restera ? Vous, ami de bronze. J’ai toujours cherché
une amitié forte et telle que la mort seule la pût renverser, bonheur
et malheur que j’ai eu, hélas ! dans Maurice. Nulle femme n’a pu ni
ne le pourra remplacer ; nulle, même la plus distinguée, n’a pu
m’offrir cette liaison d’intelligence et de goûts, cette relation large,
unie et de tenue. Rien de fixe, de durée, de vital dans les sentiments
des femmes ; leurs attachements entre elles ne sont que de jolis
nœuds de rubans. Je les remarque, ces légères tendresses, dans
toutes les amies. Ne pouvons-nous donc pas nous aimer
autrement ? Je ne sais ni n’en connais d’exemple au présent, pas
même dans l’histoire. Oreste et Pylade n’ont pas de sœurs. Cela
m’impatiente quand j’y pense, et que vous autres ayez au cœur une
chose qui nous y manque. En revanche, nous avons le dévouement.
Une belle voix, la seule agréable que j’aie entendue de ces voix
des rues de Paris, si misérables et boueuses. L’abjection de l’âme
s’exprime en tout.
… En général, nous sommes bien mal élevées, ce me semble, et
tout contrairement à notre destinée. Nous qui devons tant souffrir, on
nous laisse sans force ; on ne cultive que nos nerfs et notre
sensibilité, et en sus la vanité ; la religion, la morale pour la forme,
sans la faire passer comme direction dans l’esprit. Cela fait mal à
voir, pauvres petites filles !
Le 22. — Rien ne me choque plus rudement que l’injustice, que
j’en sois ou non l’objet. Je souffre d’une manière incroyable rien qu’à
voir donner raison à un enfant qui a tort et vice versâ. Le moindre
renversement de la vérité me déplaît. Cette susceptibilité est-elle un
défaut ? Je ne sais. Personne ne m’a jamais avertie de rien. Mon
père m’aime trop pour me juger, pour me trouver aucune
imperfection. Il faut un œil ni trop loin ni trop près pour bien
distinguer une âme et voir ses défauts. Vous, Jules, êtes à parfaite
distance pour me voir et ce qui me manque. Il doit me manquer
beaucoup. Je veux vous demander cela avant de nous quitter ; je
veux avoir vos observations que je tiendrai comme une preuve de
votre affection. On se doit de perfectionner ce qu’on aime. On le
veut, on en parle même mal ou mal à propos…
Le 27. — Écrire des lettres de deuil, en lire et concerter avec ce

pauvre M. de M…, qui n’en peut plus à lui seul sous tant d’affaires et
de peines, c’est mon emploi de temps et de cœur depuis quelques
jours, aux dépens de mon Mémorandum. La mort de M. de Sainte-
M… accroît tellement le poids des peines de notre affligé, que je
demeure tant que je puis auprès de lui comme aide ou diversion.
Bien souvent je surprends des larmes dans ses yeux, qu’il détourne
de sa femme pour ne pas se trahir. Le terrible secret, qu’une mort
dans le cœur vis-à-vis du cœur que cette mort doit frapper ! Marie
est incapable en ce moment de supporter un tel coup. Je ne sais
tout ce qu’on peut craindre pour elle à cette annonce, même en
meilleur état de santé. Que deviendra-t-elle en apprenant qu’elle a
perdu son père, si bon, si aimable, si digne d’être aimé ? Tout ce
qu’il y avait en lui d’attachant va la saisir éperdument comme les
étreintes d’un fantôme. Elle en aura des épouvantes de tendresse,
ne verra que de quoi se désoler et se trouver, par cette mort, la plus
malheureuse des filles. Au fond, elle tenait à son père, et ce fond est
si excellemment tendre ! Elle n’a jamais méconnu les qualités
distinguées de son père, son élévation d’âme, de cœur,
d’intelligence. L’homme rare par tous ces endroits ! Par sa droiture
de principes, sa raison forte, son amabilité, sa religion éclairée.
J’aimais cette piété franche, gaie, vive, toute militaire, l’homme des
camps dans le service de Dieu, et que la foi avait entièrement
dompté. Maurice me l’avait dit, et je l’ai vu de près. Il avait dû y avoir
là un Othello, un caractère fort et terrible. Certains traits de violence
l’attestent et le trahissaient encore quelquefois ; mais en général cet
homme était si contenu, que, pour qui le connaissait, c’était un bel
exemple de la puissance morale. Et puis, qu’il était bon, doux, facile
à vivre ! C’est là, dans son intérieur, dans ce coin sans draperie, qu’il
se faisait bien voir, et de façon à se faire aimer beaucoup. Il
m’appelait sa fille, et je lui donnais aussi bien tendrement le nom de
père. Hélas ! que sert de multiplier ses affections ? C’est se préparer
des deuils. Je regrette bien profondément M. de Sainte-M… Sa
mémoire me sera toujours en vénération et pieuse tendresse,
comme un saint aimé.
Le 2 octobre. — Au retour de notre pose au Palais-Royal, je me

repose dans ma chambre et dans le souvenir de notre entretien. Une
femme a dit que l’amitié, c’était pour elle un canapé de velours dans
un boudoir. C’est bien cela, mais hors du boudoir, pour moi, et haut
placé sur un cap, par-dessus le monde. Cette situation à part de tout
me plaît ainsi.
Le 3. — Détournée hier sur mon cap. Je ne reprends mon journal

que pour le clore, n’ayant plus liberté d’écrire en repos. C’est
dimanche aujourd’hui ; heureusement j’ai puisé du calme et de la
force à l’église, pour soutenir un assaut accablant.
VI
[1842, à Rivières.] — Je n’écris plus depuis quelque temps, mais

il est des jours qu’on ne veut pas perdre, et je veux retrouver celui-ci
si rempli d’émotions et de larmes. O puissance des lieux et des
souvenirs ! C’est ici, c’est à R… qu’il était venu souvent dans les
vacances, joyeux étudiant, bondissant dans les prés, franchissant
les cascades avec les enfants du château. Nous avons rappelé ce
temps et parlé de lui, intimement et sans fin, avec cette bonne,
tendre et parfaite Mme de R… qui pleurait. Qu’il m’avait tardé de la
voir pour ce que nous venons de faire, parler de Maurice ! Il y a pour
moi là dedans une jouissance de douleur, un bonheur dans les
larmes inexprimable. Mon Dieu, que j’ai peu vécu parmi les vivants
aujourd’hui ! Et ce qui m’a fort touchée encore, c’est de voir une
caisse où il y a son nom, une caisse de collége où il mettait des
livres de moitié avec le petit G…, précieusement conservée en ce
souvenir à R…, on m’en a demandé le don. Il y a de ces simples
choses qui pénètrent l’âme.
Ouvert par hasard un album où j’ai trouvé la mort de Maurice,
mort répandue partout. J’ai été bien touchée de la trouver là, sur ces
pages secrètes, dans un journal de jeune fille, dans un fond de
cœur : hommage inconnu et le plus délicat qui soit offert à Maurice.
Que cette parole est vraie : il était leur vie ! Tous ceux qui nous ont
compris la diront. Il est de ces existences, de ces natures de cœur
qui fournissent tant à d’autres qu’il semble que ces autres en
viennent. Maurice était ma source ; de lui me coulait amitié,
sympathie, conseil, douceur de vivre par son commerce intellectuel
si doux, par ce de lui en moi qui était comme le ferment de mes
pensées, enfin l’alimentation de mon âme. Ce grand ami perdu, il ne
me faut rien moins que Dieu pour le remplacer.
Espérer ou craindre pour un autre est la seule chose qui donne à
l’homme le sentiment complet de sa propre existence.
[31 décembre, au Cayla.] — C’était ma coutume autrefois de finir

l’année mentalement avec quelqu’un, avec Maurice. A présent qu’il
est mort, ma pensée reste solitaire. Je garde en moi ce qui s’élève
par cette chute du temps dans l’éternité. Un dernier jour, que c’est
solennellement triste !
TABLE
Pages.
Avertissement I
Journal d’Eugénie de Guérin 1
I (15 novembre 1834-13 avril 1835) 3
II (14 avril-5 décembre 1835) 59
III (mars-mai 1836) 105
IV (mai-juin 1837) 119
V (26 janvier-19 février 1838) 143
VI (19 février-3 mai 1838) 161
VII (3 mai-29 septembre 1838) 199
VIII (10 avril-25 mai 1839) 247
IX (21 juillet 1839-9 janvier 1840) 275
X (9 janvier-19 juillet 1840) 327
XI (26 juillet-29 août 1840) 391
XII (1er novembre-31 décembre 1840) 409
Fragments 419
PARIS. — IMPRIMERIE DE J. CLAYE, RUE SAINT-BENOIT, 7.

PUBLICATIONS NOUVELLES DE LA LIBRAIRIE ACADÉMIQUE
DIDIER ET Cie
MADAME SWETCHINE
JOURNAL DE SA CONVERSION, MÉDITATIONS ET PRIÈRES. 1
volume in-8o 7 fr. 50
Le même ouvrage, 1 vol. in-12 3 fr. 50
VIE ET PENSÉES DE Mme SWETCHINE, publiées par M. le Comte
de Falloux, de l’Académie française, 2 vol. in-8o 15 fr.
Le même ouvrage, 2 vol. in-12 7 fr.
LETTRES DE Mme SWETCHINE, publiées par M. le Comte de
Falloux. 2 vol. in-8o 15 fr.
CORRESPONDANCE DU R. P. LACORDAIRE ET DE Mme
SWETCHINE, publiée par M. le Comte de Falloux. 1 fort vol. in-
8o 7 fr. 50
MADAME LA PRINCESSE DE BROGLIE
LES VERTUS CHRÉTIENNES, expliquées par des récits tirés de la
Vie des Saints. 2 beaux vol. in-12 illustrés 6 fr.
MADAME LA MARQUISE DE SAINTE-AULAIRE
LA CHANSON D’ANTIOCHE, composée par Richard le Pèlerin et
Graindor, de Douai, et traduite. 1 vol. in-12 3 fr. 50
MADAME LA COMTESSE D’***, NÉE DE SÉGUR
LA REINE MARIE LECKZINSKA. Étude historique. 1 vol. in-12. 3 fr.
MADAME A. TASTU
POÉSIES COMPLÈTES, nouvelle et très-jolie édition illustrée de
vignettes de Johannot. 1 fort vol. in-12 3 fr. 50
L’ÉDUCATION MATERNELLE, simples leçons d’une mère à ses
enfants sur la lecture, l’écriture, la grammaire, etc. 1 vol. grand in-
8o illustré 15 fr.
MADAME GUILLON-VIARDOT
CINQ ANNÉES DE LA VIE DES JEUNES FILLES. (L’entrée dans le
monde.) 1 joli vol. in-12 3 fr. 50
MADAME PENQUER
LES CHANTS DU FOYER, Poésies, 3e édit. 1 vol. in-12 3 fr. 50
MADAME LA VICOMTESSE DE DAX
L’AMOUR ET LA FEMME. 1 vol. in-12 2 fr.
MADAME ***
LA VIE DE VILLAGE EN ANGLETERRE, ou Souvenirs d’un Exilé,
par l’auteur de l’Étude sur Channing. 2e édit. 1 vol. in-12. 3 fr. 50
PARIS. — J. CLAYE, IMPRIMEUR, 7 RUE SAINT-BENOIT.

*** END OF THE PROJECT GUTENBERG EBOOK JOURNAL ET
FRAGMENTS ***
Updated editions will replace the previous one—the old editions

will be renamed.
Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright
in these works, so the Foundation (and you!) can copy and
distribute it in the United States without permission and without
paying copyright royalties. Special rules, set forth in the General
Terms of Use part of this license, apply to copying and
distributing Project Gutenberg™ electronic works to protect the
PROJECT GUTENBERG™ concept and trademark. Project
Gutenberg is a registered trademark, and may not be used if
you charge for an eBook, except by following the terms of the
trademark license, including paying royalties for use of the
Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is
very easy. You may use this eBook for nearly any purpose such
as creation of derivative works, reports, performances and
research. Project Gutenberg eBooks may be modified and
printed and given away—you may do practically ANYTHING in
the United States with eBooks not protected by U.S. copyright
law. Redistribution is subject to the trademark license, especially
commercial redistribution.
START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK
To protect the Project Gutenberg™ mission of promoting the

free distribution of electronic works, by using or distributing this
work (or any other work associated in any way with the phrase
“Project Gutenberg”), you agree to comply with all the terms of
the Full Project Gutenberg™ License available with this file or
online at www.gutenberg.org/license.
Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand,
agree to and accept all the terms of this license and intellectual
property (trademark/copyright) agreement. If you do not agree to
abide by all the terms of this agreement, you must cease using
and return or destroy all copies of Project Gutenberg™
electronic works in your possession. If you paid a fee for
obtaining a copy of or access to a Project Gutenberg™
electronic work and you do not agree to be bound by the terms
of this agreement, you may obtain a refund from the person or
entity to whom you paid the fee as set forth in paragraph 1.E.8.
1.B. “Project Gutenberg” is a registered trademark. It may only

be used on or associated in any way with an electronic work by
people who agree to be bound by the terms of this agreement.
There are a few things that you can do with most Project
Gutenberg™ electronic works even without complying with the
full terms of this agreement. See paragraph 1.C below. There
are a lot of things you can do with Project Gutenberg™
electronic works if you follow the terms of this agreement and
help preserve free future access to Project Gutenberg™
electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright
law in the United States and you are located in the United
States, we do not claim a right to prevent you from copying,
distributing, performing, displaying or creating derivative works
based on the work as long as all references to Project
Gutenberg are removed. Of course, we hope that you will
support the Project Gutenberg™ mission of promoting free
access to electronic works by freely sharing Project
Gutenberg™ works in compliance with the terms of this
agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms
of this agreement by keeping this work in the same format with
its attached full Project Gutenberg™ License when you share it
without charge with others.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E. Unless you have removed all references to Project

Gutenberg:
1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project
Gutenberg™ work (any work on which the phrase “Project
Gutenberg” appears, or with which the phrase “Project
Gutenberg” is associated) is accessed, displayed, performed,
viewed, copied or distributed:
This eBook is for the use of anyone anywhere in the United

States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it
away or re-use it under the terms of the Project Gutenberg
License included with this eBook or online at
www.gutenberg.org. If you are not located in the United
States, you will have to check the laws of the country where
you are located before using this eBook.
1.E.2. If an individual Project Gutenberg™ electronic work is

derived from texts not protected by U.S. copyright law (does not
contain a notice indicating that it is posted with permission of the
copyright holder), the work can be copied and distributed to
anyone in the United States without paying any fees or charges.
If you are redistributing or providing access to a work with the
phrase “Project Gutenberg” associated with or appearing on the
work, you must comply either with the requirements of
paragraphs 1.E.1 through 1.E.7 or obtain permission for the use
of the work and the Project Gutenberg™ trademark as set forth
in paragraphs 1.E.8 or 1.E.9.
1.E.3. If an individual Project Gutenberg™ electronic work is

posted with the permission of the copyright holder, your use and
distribution must comply with both paragraphs 1.E.1 through
1.E.7 and any additional terms imposed by the copyright holder.
Additional terms will be linked to the Project Gutenberg™
License for all works posted with the permission of the copyright
holder found at the beginning of this work.
1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files
containing a part of this work or any other work associated with
Project Gutenberg™.
1.E.5. Do not copy, display, perform, distribute or redistribute
this electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1
with active links or immediate access to the full terms of the
Project Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must, at
no additional cost, fee or expense to the user, provide a copy, a
means of exporting a copy, or a means of obtaining a copy upon
request, of the work in its original “Plain Vanilla ASCII” or other
form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™
works unless you comply with paragraph 1.E.8 or 1.E.9.
1.E.8. You may charge a reasonable fee for copies of or

providing access to or distributing Project Gutenberg™
electronic works provided that:
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information

Neural Information Processing 27th International Conference ICONIP 2020 Bangkok Thailand November 23 27 2020 Proceedings Part III Haiqin Yang

Uploaded by

Copyright:

Available Formats

You might also like

Neural Information Processing 27th International Conference ICONIP 2020 Bangkok Thailand November 23 27 2020 Proceedings Part III Haiqin Yang

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Neural Information Processing 27th International Conference ICONIP 2020 Bangkok Thailand November 23 27 2020 Proceedings Part III Haiqin Yang

Uploaded by

Copyright:

Available Formats

Neural Information Processing 27th

International Conference ICONIP 2020

Neural Information Processing 27th International

Neural Information Processing 27th International

Neural Information Processing 27th International

Neural Information Processing 27th International

Blended Learning Education in a Smart Learning

Computer Networks 27th International Conference CN 2020

Cooperative Design, Visualization, and Engineering:

Neural Information Processing: 24th International

Editorial Board Members

Andrew Chi-Sing Leung•

James T. Kwok Jonathan H. Chan

Irwin King (Eds.)

ISSN 0302-9743 ISSN 1611-3349 (electronic)

© Springer Nature Switzerland AG 2020

November 2020 Haiqin Yang

Local Arrangements Chair

Special Sessions Chairs

Senior Program Committee

Wei Liu Tencent, China

De-Nian Yang Academia Sinica, Taiwan

Chuan Chen Sun Yat-sen University, China

Xin Gao King Abdullah University of Science and Technology,

Wei Jin Michigan State University, USA

Chengchuang Lin South China Normal University, China

Kazuteru Miyazaki National Institution for Academic Degrees and Quality

Rafal Scherer Czestochowa University of Technology, Poland

Nhi N.Y. Vo University of Technology Sydney, Australia

Feidiao Yang Chinese Academy of Sciences, China

Jinghui Zhong South China University of Technology, China

Classification of Neuroblastoma Histopathological Images Using

Data Mining ENCODE Data Predicts a Significant Role of SINA3

Diabetic Retinopathy Detection Using Multi-layer Neural Networks

Enhancer-DSNet: A Supervisedly Prepared Enriched Sequence

Machine Learned Pulse Transit Time (MLPTT) Measurements from

Weight Aware Feature Enriched Biomedical Lexical Answer

Neural Data Analysis

Decoding Olfactory Cognition: EEG Functional Modularity Analysis

Identifying Motor Imagery-Related Electroencephalogram Features During

Inter and Intra Individual Variations of Cortical Functional Boundaries

Phase Synchronization Indices for Classification of Action Intention

The Evaluation of Brain Age Prediction by Different Functional Brain

Transfer Dataset in Image Segmentation Use Case . . . . . . . . . . . . . . . . . . . 135

Neural Network Models

A Gaussian Process-Based Incremental Neural Network

Analysis on the Boltzmann Machine with Random Input Drifts

Are Deep Neural Architectures Losing Information? Invertibility

Automatic Dropout for Deep Neural Networks . . . . . . . . . . . . . . . . . . . . . . 185

Bayesian Randomly Wired Neural Network with Variational Inference

Brain-Inspired Framework for Image Classification with a New

Estimating Conditional Density of Missing Values Using Deep Gaussian

Environmentally-Friendly Metrics for Evaluating the Performance of Deep

Hybrid Deep Shallow Network for Assessment of Depression Using

Iterative Imputation of Missing Data Using Auto-Encoder Dynamics . . . . . . . 258

Multi-objective Evolution for Deep Neural Network Architecture Search . . . . 270

Neural Architecture Search for Extreme Multi-label Text Classification . . . . . 282

Non-linear ICA Based on Cramer-Wold Metric. . . . . . . . . . . . . . . . . . . . . . 294