检索结果-内蒙古大学图书馆

Detecting anomalous citation groups in journal networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Kojaku, Sadamori Livan, Giacomo Masuda, Naoki Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN47408 United States Department of Computer Science University College London LondonWC1E 6EA United Kingdom Systemic Risk Centre London School of Economics and Political Science LondonWC2A 2AE United Kingdom Department of Mathematics University at Buffalo State University of New York BuffaloNY United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-2900 United States Faculty of Science and Engineering Waseda University Tokyo169-8555 Japan

The ever-increasing competitiveness in the academic publishing market incentivizes journal editors to pursue higher impact factors. This translates into journals becoming more selective, and, ultimately, into higher publication standards. However, the fixation on higher impact factors leads some journals to artificially boost impact factors through the coordinated effort of a "citation cartel" of journals. "Citation cartel" behavior has become increasingly common in recent years, with several instances being reported. Here, we propose an algorithm—-named CIDRE—to detect anomalous groups of journals that exchange citations at excessively high rates when compared against a null model that accounts for scientific communities and journal size. CIDRE detects more than half of the journals suspended from Journal Citation Reports due to anomalous citation behavior in the year of suspension or in advance. Furthermore, CIDRE detects many new anomalous groups, where the impact factors of the member journals are lifted substantially higher by the citations from other member journals. We describe a number of such examples in detail and discuss the implications of our findings with regard to the current academic climate. Copyright © 2020, The Authors. All rights reserved.

关键词： Publishing

学校读者我要写书评

暂无评论

Skater’s dilemma

arXiv 2020年

作者： Ichinose, Genki Miyagawa, Daiki Ito, Junji Masuda, Naoki Department of Mathematical and Systems Engineering Shizuoka University 3-5-1 Johoku Naka-ku Hamamatsu432-8561 Japan Skating Club Yamanashi Gakuin University 2-4-5 Sakaori Kofu Yamanashi400-8575 Japan Department of Mathematics University at Buffalo State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States

In some athletic races, such as cycling and types of speed skating races, athletes have to complete a relatively long distance at a high speed in the presence of direct opponents. To win such a race, athletes are motivated to hide behind others to suppress energy consumption before a final moment of the race. This situation seems to produce a social dilemma: players want to hide behind others, whereas if a group of players attempts to do so, they may all lose to other players that overtake them. To support that speed skaters are involved in such a social dilemma, we analyzed video footage data for 14 mass start skating races to find that skaters that hid behind others to avoid air resistance for a long time before the final lap tended to win. Furthermore, the finish rank of the skaters in mass start races was independent of the record of the same skaters in time-trial races measured in the absence of direct opponents. The results suggest that how to strategically cope with a skater’s dilemma may be a key determinant for winning long-distance and high-speed races with direct *** Codes 91A80 Copyright © 2020, The Authors. All rights reserved.

关键词： Game theory

Modeling temporal networks with bursty activity patterns of nodes and links

学校读者我要写书评

暂无评论

Physical Review Research 2020年第2期2卷 023073-023073页

作者： Takayuki Hiraoka Naoki Masuda Aming Li Hang-Hyun Jo Department of Computer Science Aalto University Espoo 00076 Finland Asia Pacific Center for Theoretical Physics Pohang 37673 Republic of Korea Department of Mathematics University at Buffalo State University of New York Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York Buffalo New York 14260-5030 USA Department of Zoology University of Oxford Oxford OX1 3PS United Kingdom Department of Biochemistry University of Oxford Oxford OX1 3QU United Kingdom Department of Physics The Catholic University of Korea Bucheon 14662 Republic of Korea

The concept of temporal networks provides a framework to understand how the interaction between system components changes over time. In empirical communication data, we often detect non-Poissonian, so-called bursty behavior in the activity of nodes as well as in the interaction between nodes. However, such reconciliation between node burstiness and link burstiness cannot be explained if the interaction processes on different links are independent of each other. This is because the activity of a node is the superposition of the interaction processes on the links incident to the node, and the superposition of independent bursty point processes is not bursty in general. Here we introduce a temporal network model based on bursty node activation, and we show that it leads to heavy-tailed interevent time distributions for both node dynamics and link dynamics. Our analysis indicates that activation processes intrinsic to nodes give rise to dynamical correlations across links. Our framework offers a way to model competition and correlation between links, which is key to understanding dynamical processes in various systems.

关键词： Collective behavior in networks Dynamics of networks Scaling laws of complex systems Social systems Communication networks Multiple time scale dynamics Networks & random structures Social networks Evolving network models Network Models Non-Markovian processes Time series analysis

Modeling temporal networks with bursty activity patterns of nodes and links

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hiraoka, Takayuki Masuda, Naoki Li, Aming Jo, Hang-Hyun Asia Pacific Center for Theoretical Physics Pohang37673 Korea Republic of Department of Mathematics University at Buffalo State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York BuffaloNY14260-5030 United States Department of Zoology University of Oxford OxfordOX1 3PS United Kingdom Department of Biochemistry University of Oxford OxfordOX1 3QU United Kingdom Department of Physics Pohang University of Science and Technology Pohang37673 Korea Republic of Department of Computer Science Aalto University EspooFI-00076 Finland

The concept of temporal networks provides a framework to understand how the interaction between system components changes over time. In empirical communication data, we often detect non-Poissonian, so-called bursty behavior in the activity of nodes as well as in the interaction between nodes. However, such reconciliation between node burstiness and link burstiness cannot be explained if the interaction processes on different links are independent of each other. This is because the activity of a node is the superposition of the interaction processes on the links incident to the node and the superposition of independent bursty point processes is not bursty in general. Here we introduce a temporal network model based on bursty node activation and show that it leads to heavy-tailed inter-event time distributions for both node dynamics and link dynamics. Our analysis indicates that activation processes intrinsic to nodes give rise to dynamical correlations across links. Our framework offers a way to model competition and correlation between links, which is key to understanding dynamical processes in various systems. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical activation

Biases in Inverse Ising Estimates of Near-Critical Behaviour

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kloucek, Maximilian B. Machon, Thomas Kajimura, Shogo Royall, C. Patrick Masuda, Naoki Turci, Francesco H.H. Wills Laboratory School of Physics University of Bristol Bristol United Kingdom Bristol Centre for Functional Nanomaterials University of Bristol Bristol United Kingdom Faculty of Information and Human Sciences Kyoto Institute of Technology Kyoto606-8585 Japan Gulliver UMR CNRS 7083 ESPCI Paris Université PSL Paris75005 France Department of Mathematics State University of New York BuffaloNY14260-2900 United States Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo BuffaloNY14260-5030 United States

Inverse Ising inference allows pairwise interactions of complex binary systems to be reconstructed from empirical correlations. Typical estimators used for this inference, such as Pseudo-likelihood maximization (PLM), are biased. Using the Sherrington-Kirkpatrick (SK) model as a benchmark, we show that these biases are large in critical regimes close to phase boundaries, and may alter the qualitative interpretation of the inferred model. In particular, we show that the small-sample bias causes models inferred through PLM to appear closer-to-criticality than one would expect from the data. data-driven methods to correct this bias are explored and applied to a functional magnetic resonance imaging (fMRI) dataset from neuroscience. Our results indicate that additional care should be taken when attributing criticality to real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Criticality (nuclear fission)

Accurately predicting anticancer peptide using an ensemble of heterogeneously trained classifiers

学校读者我要写书评

暂无评论

Informatics in Medicine Unlocked 2023年 42卷

作者： Azim, Sayed Mehedi Sabab, Noor Hossain Nuri Noshadi, Iman Alinejad-Rokny, Hamid Sharma, Alok Shatabda, Swakkhar Dehzangi, Iman Center for Computational and Integrative Biology Rutgers University Camden 08102 NJ United States Department of Computer Science and Engineering United International University Plot 2 United City Madani Avenue BaddaDhaka 1212 Bangladesh Department of Bioengineering University of California Riverside 92507 CA United States BioMedical Machine Learning Lab The Graduate School of Biomedical Engineering The University of New South Wales (UNSW Sydney) Sydney NSW 2052 Australia UNSW Data Science Hub UNSW Sydney Sydney NSW 2052 Australia Health Data Analytics Program AI-enabled Processes Research Centre Macquarie University Sydney 2109 Australia Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia Laboratory for Medical Science Mathematics RIKEN Center for Integrative Medical Sciences Yokohama 230-0045 Japan Department of Computer Science Rutgers University Camden 08102 NJ United States

The use of therapeutic peptides for the treatment of cancer has received tremendous attention in recent years. Anticancer peptides (ACPs) are considered new anticancer drugs which have several advantages over chemistry-based drugs including high specificity, strong tumor penetration capacity, and low toxicity level for normal cells. Due to the rise of experimentally verified bioactive peptides, several in silico approaches became imperative for the investigation of the characteristics of ACPs. In this paper, we proposed a new machine learning tool named iACP-RF that uses a combination of several sequence-based features and an ensemble of three heterogeneously trained Random Forest classifiers to accurately predict anticancer peptides. Experimental results show that our proposed model achieves an accuracy of 75.9% which outperforms other state-of-the-art methods by a significant margin. We also achieve 0.52, 75.6%, and 76.2% in terms of Matthews Correlation Coefficient (MCC), Sensitivity, and Specificity, respectively. iACP-RF as a standalone tool and its source code are publicly available at: https://***/MLBC-lab/iACP-RF. © 2023 The Authors

关键词： Anticancer peptides Ensemble learning Feature extraction Heterogeneous classifiers Machine learning Random Forest

Recurrence quantification analysis of dynamic brain networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Lopes, Marinho A. Zhang, Jiaxiang Krzemiński, Dominik Hamandi, Khalid Chen, Qi Livi, Lorenzo Masuda, Naoki Department of Engineering Mathematics University of Bristol BS8 1UB United Kingdom Cardiff University Brain Research Imaging Centre School of Psychology Cardiff University CardiffCF24 4HQ United Kingdom Center for Studies of Psychological Application School of Psychology South China Normal University Guangzhou510631 China Departments of Computer Science and Mathematics University of Manitoba WinnipegMBR3T 2N2 Canada Department of Computer Science College of Engineering Mathematics and Physical Sciences University of Exeter ExeterEX4 4QF United Kingdom Department of Mathematics University at Buffalo State University of New York United States Computational and Data-Enabled Science and Engineering Program University at Buffalo State University of New York United States

Evidence suggests that brain network dynamics is a key determinant of brain function and dysfunction. Here we propose a new framework to assess the dynamics of brain networks based on recurrence analysis. Our framework uses recurrence plots and recurrence quantification analysis to characterize dynamic networks. For resting-state magnetoencephalographic dynamic functional networks (dFNs), we have found that functional networks recur more quickly in people with epilepsy than healthy controls. This suggests that recurrence of dFNs may be used as a biomarker of epilepsy. For stereo electroencephalography data, we have found that dFNs involved in epileptic seizures emerge before seizure onset, and recurrence analysis allows us to detect seizures. We further observe distinct dFNs before and after seizures, which may inform neurostimulation strategies to prevent seizures. Our framework can also be used for understanding dFNs in brain function in health and other neurological disorders. Copyright © 2020, The Authors. All rights reserved.

关键词： Electroencephalography

data-driven brain network models predict individual variability in behavior

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Bansal, Kanika Medaglia, John D. Bassett, Danielle S. Vettel, Jean M. Muldoon, Sarah F. Department of Mathematics University at Buffalo BuffaloNY United States U.S. Army Research Laboratory Aberdeen Proving GroundMD United States Department of Biomedical Engineering Columbia University New YorkNY United States Department of Psychology Drexel University PhiladelphiaPA United States Department of Neurology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Biomedical Engineering University of Pennsylvania PhiladelphiaPA United States Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA United States Department of Physics and Astronomy University of Pennsylvania PhiladelphiaPA United States Department of Psychological and Brain Sciences University of California Santa BarbaraCA United States Computational and Data-Enabled Science and Engineering Program University at Buffalo-SUNY BuffaloNY United States

The relationship between brain structure and function has been probed using a variety of approaches, but how the underlying structural connectivity of the human brain drives behavior is far from understood. To investigate the effect of anatomical brain organization on human task performance, we use a data-driven computational modeling approach and explore the functional effects of naturally occurring structural differences in brain networks. We construct personalized brain network models by combining anatomical connectivity estimated from diffusion spectrum imaging of individual subjects with a nonlinear model of brain dynamics. By performing computational experiments in which we measure the excitability of the global brain network and spread of synchronization following a targeted computational stimulation, we quantify how individual variation in the underlying connectivity impacts both local and global brain dynamics. We further relate the computational results to individual variability in the subjects' performance of three language-demanding tasks both before and after transcranial magnetic stimulation to the left-inferior frontal gyrus. Our results show that task performance correlates with either local or global measures of functional activity, depending on the complexity of the task. By emphasizing differences in the underlying structural connectivity, our model serves as a powerful tool to predict individual differences in task performances, to dissociate the effect of targeted stimulation in tasks that differ in cognitive complexity, and to pave the way for the development of personalized therapeutics. Copyright © 2018, The Authors. All rights reserved.

关键词： Digital storage

Biases in inverse Ising estimates of near-critical behavior

学校读者我要写书评

暂无评论

Physical Review E 2023年第1期108卷 014109-014109页

作者： Maximilian B. Kloucek Thomas Machon Shogo Kajimura C. Patrick Royall Naoki Masuda Francesco Turci School of Physics HH Wills Physics Laboratory University of Bristol Tyndall Avenue Bristol BS8 1TL United Kingdom Bristol Centre for Functional Nanomaterials HH Wills Physics Laboratory University of Bristol Tyndall Avenue Bristol BS8 1TL United Kingdom Faculty of Information and Human Sciences Kyoto Institute of Technology Kyoto 606-8585 Japan Gulliver UMR CNRS 7083 ESPCI Paris Université PSL 75005 Paris France Department of Mathematics State University of New York at Buffalo Buffalo New York 14260-2900 USA Computational and Data-Enabled Science and Engineering Program State University of New York at Buffalo Buffalo New York 14260-5030 USA

Inverse Ising inference allows pairwise interactions of complex binary systems to be reconstructed from empirical correlations. Typical estimators used for this inference, such as pseudo-likelihood maximization (PLM), are biased. Using the Sherrington-Kirkpatrick model as a benchmark, we show that these biases are large in critical regimes close to phase boundaries, and they may alter the qualitative interpretation of the inferred model. In particular, we show that the small-sample bias causes models inferred through PLM to appear closer to criticality than one would expect from the data. data-driven methods to correct this bias are explored and applied to a functional magnetic resonance imaging data set from neuroscience. Our results indicate that additional care should be taken when attributing criticality to real-world data sets.

关键词： Critical phenomena Cortical networks Spin glasses Functional magnetic resonance imaging Ising model