2022 IEEE International Conference on Data Mining (ICDM)最新文献

筛选
英文 中文
Efficient Semi-Supervised Adversarial Training without Guessing Labels 有效的半监督对抗训练,无需猜测标签
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00064
Huisi Wu, W. Vazelhes, Bin Gu
{"title":"Efficient Semi-Supervised Adversarial Training without Guessing Labels","authors":"Huisi Wu, W. Vazelhes, Bin Gu","doi":"10.1109/ICDM54844.2022.00064","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00064","url":null,"abstract":"Adversarial training has been proved to be the most effective defensive strategy to protect models from adversarial attacks. In the practical application scenario of adversarial training, besides labeled data, we also face an enormous amount of unlabeled data. However, existing adversarial training methods are naturally targeting supervised learning problems. To adapt to semi-supervised learning problems, they need to estimate labels for unlabeled data in advance, which inevitably degenerates the performance of the learned model due to the bias on the estimation of labels for unlabeled data. To mitigate this issue, in this paper, we propose a new semi-supervised adversarial training framework via maximizing AUCs which is also a minimax problem but treats the unlabeled samples as both positive and negative ones, which allows us to avoid guessing labels for unlabeled data. Quite naturally, the minimax problem can be solved via a traditional adversarial training algorithm by extending singly stochastic gradients to triply stochastic gradients, to adapt to the three (i.e. positive, negative, and unlabeled) data sources. To further accelerate the training procedure, we transform the minimax adversarial training problem into an equivalent minimization one based on the kernel perspective. For the minimization problem, we discuss scalable and efficient algorithms not only for deep neural networks but also for kernel support vector machines. Extensive experimental results show that our algorithms not only achieve better generalization performance against various adversarial attacks, but also enjoy efficiency and scalability when considered from the kernel perspective.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116758243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Mean-Optimal Robust Linear Discriminant Analysis 均值最优鲁棒线性判别分析
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00129
Xiangyu Li, Hua Wang
{"title":"On Mean-Optimal Robust Linear Discriminant Analysis","authors":"Xiangyu Li, Hua Wang","doi":"10.1109/ICDM54844.2022.00129","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00129","url":null,"abstract":"Linear discriminant analysis (LDA) is widely used for dimensionality reduction under supervised learning settings. Traditional LDA objective aims to minimize the ratio of squared Euclidean distances that may not perform optimally on noisy data sets. Multiple robust LDA objectives have been proposed to address this problem, but their implementations have two major limitations. One is that their mean calculations use the squared $ell_{2}$-norm distance to center the data, which is not valid when the objective does not use the Euclidean distance. The second problem is that there is no generalized optimization algorithm to solve different robust LDA objectives. In addition, most existing algorithms can only guarantee the solution to be locally optimal, rather than globally optimal. In this paper, we review multiple robust loss functions and propose a new and generalized robust objective for LDA. Besides, to better remove the mean value within data, our objective uses an optimal way to center the data through learning. As one important algorithmic contribution, we derive an efficient iterative algorithm to optimize the resulting non-smooth and non-convex objective function. We theoretically prove that our solution algorithm guarantees that both the objective and the solution sequences converge to globally optimal solutions at a sub-linear convergence rate. The experimental results demonstrate the effectiveness of our new method, achieving significant improvements compared to the other competing methods.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125047270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Empowerment-driven Policy Gradient Learning with Counterfactual Augmentation in Recommender Systems 推荐系统中基于反事实增强的赋权驱动策略梯度学习
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00102
Xiaocong Chen, L. Yao, Xiaojun Chang, Siyu Wang
{"title":"Empowerment-driven Policy Gradient Learning with Counterfactual Augmentation in Recommender Systems","authors":"Xiaocong Chen, L. Yao, Xiaojun Chang, Siyu Wang","doi":"10.1109/ICDM54844.2022.00102","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00102","url":null,"abstract":"Deep reinforcement learning (DRL) has been proven its efficiency in capturing users’ dynamic interests in recent literature. However, training a DRL agent is challenging, because of the sparse environment in recommender systems (RS), DRL agents could spend times either exploring informative user-item interaction trajectories or using existing trajectories for policy learning. It is also known as the exploration and exploitation trade-off which affects the recommendation performance significantly when the environment is sparse. It is more challenging to balance the exploration and exploitation in DRL RS where RS agent need to deeply explore the informative trajectories and exploit them efficiently in the context of recommender systems. As a step to address this issue, We design a novel empowerment-driven exploration method to increase the capability of exploring informative interaction trajectories in the sparse environment, which are further enriched via a counterfactual augmentation strategy for more efficient exploitation. The extensive experiments on four offline datasets and an online simulation platform demonstrate the superiority of our model to a set of existing state-of-the-art methods.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126641641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Query-Efficient Target-Agnostic Black-Box Attack 查询高效目标不可知黑盒攻击
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00047
Raha Moraffah, Huan Liu
{"title":"Query-Efficient Target-Agnostic Black-Box Attack","authors":"Raha Moraffah, Huan Liu","doi":"10.1109/ICDM54844.2022.00047","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00047","url":null,"abstract":"Adversarial attacks have recently been proposed to scrutinize the security of deep neural networks. Most blackbox adversarial attacks, which have partial access to the target through queries, are target-specific; e.g., they require a well-trained surrogate that accurately mimics a given target. In contrast, target-agnostic black-box attacks are developed to attack any target; e.g., they learn a generalized surrogate that can adapt to any target via fine-tuning on samples queried from the target. Despite their success, current state-of-the-art target-agnostic attacks require tremendous fine-tuning steps and consequently an immense number of queries to the target to generate successful attacks. The high query complexity of these attacks makes them easily detectable and thus defendable. We propose a novel query-efficient target-agnostic attack that trains a generalized surrogate network to output the adversarial directions iv.r.t. the inputs and equip it with an effective fine-tuning strategy that only fine-tunes the surrogate when it fails to provide useful directions to generate the attacks. Particularly, we show that to effectively adapt to any target and generate successful attacks, it is sufficient to fine-tune the surrogate with informative samples that help the surrogate get out of the failure mode with additional information on the target’s local behavior. Extensive experiments on CIFAR10 and CIFAR-100 datasets demonstrate that the proposed target-agnostic approach can generate highly successful attacks for any target network with very few fine-tuning steps and thus significantly smaller number of queries (reduced by several order of magnitudes) compared to the state-of-the-art baselines.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117080673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Invariant Factor Graph Neural Networks 不变因子图神经网络
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00110
Zheng Fang, Ziyun Zhang, Guojie Song, Yingxue Zhang, Dong Li, Jianye Hao, Xi Wang
{"title":"Invariant Factor Graph Neural Networks","authors":"Zheng Fang, Ziyun Zhang, Guojie Song, Yingxue Zhang, Dong Li, Jianye Hao, Xi Wang","doi":"10.1109/ICDM54844.2022.00110","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00110","url":null,"abstract":"Graph neural networks (GNNs) have achieved significant success in numerous fields under settings where training and testing graphs are identically distributed. However, this setting is rarely satisfied in real life. Due to the lack of out-of-distribution (OOD) generalization abilities, existing GNNs methods perform disappointingly when there exist distribution shifts between testing and training graphs. Though several attempts have been made to deal with the issue, they mainly focus on structural properties while overlooking rich graph feature information. To this end, we propose an Invariant Factor GNN (IFGNN), which utilizes causal factor graphs to achieve invariant performances across different environments. Specifically, we dissect the graph generalization problem in a causal view, and argue that the key of graph generalization lies in discovering causal factors. Thus we extract the latent factors in the graph through disentanglement, and the causal ones are discovered with the invariant learning mechanism. We conduct extensive experiments on both synthetic and real-world datasets with distribution shifts to validate the OOD generalization abilities. The results demonstrate that our proposed IFGNN significantly outperforms the state-of-the-art baselines.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123451611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Uncertainty Propagation in Node Classification 节点分类中的不确定性传播
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00167
Zhao Xu, Carolin (Haas) Lawrence, Ammar Shaker, Raman Siarheyeu
{"title":"Uncertainty Propagation in Node Classification","authors":"Zhao Xu, Carolin (Haas) Lawrence, Ammar Shaker, Raman Siarheyeu","doi":"10.1109/ICDM54844.2022.00167","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00167","url":null,"abstract":"Quantifying predictive uncertainty of neural networks has recently attracted increasing attention. In this work, we focus on measuring uncertainty of graph neural networks (GNNs) for the task of node classification. Most existing GNNs model message passing among nodes. The messages are often deterministic. Questions naturally arise: Does there exist uncertainty in the messages? How could we propagate such uncertainty over a graph together with messages? To address these issues, we propose a Bayesian uncertainty propagation (BUP) method, which embeds GNNs in a Bayesian modeling framework, and models predictive uncertainty of node classification with Bayesian confidence of predictive probability and uncertainty of messages. Our method proposes a novel uncertainty propagation mechanism inspired by Gaussian models. Moreover, we present an uncertainty oriented loss for node classification that allows the GNNs to clearly integrate predictive uncertainty in learning procedure. Consequently, the training examples with large predictive uncertainty will be penalized. We demonstrate the BUP with respect to prediction reliability and out-of-distribution (OOD) predictions. The learned uncertainty is also analyzed in depth. The relations between uncertainty and graph topology, as well as predictive uncertainty in the OOD cases are investigated with extensive experiments. The empirical results with popular benchmark datasets demonstrate the superior performance of the proposed method.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123597409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Meta-Transfer Learning: An application to Streamflow modeling in River-streams 元迁移学习:在河流流建模中的应用
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00026
Rahul Ghosh, Bangyan Li, Kshitij Tayal, Vipin Kumar, X. Jia
{"title":"Meta-Transfer Learning: An application to Streamflow modeling in River-streams","authors":"Rahul Ghosh, Bangyan Li, Kshitij Tayal, Vipin Kumar, X. Jia","doi":"10.1109/ICDM54844.2022.00026","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00026","url":null,"abstract":"Prediction of response to input drivers by unmonitored entities has been recognized as one of the most important problems in many scientific problems. This problem is challenging due to the non-stationary processes that underlie the dynamics of data observations over space and time. Hence, directly transferring models from well-observed data entities to unmonitored target entity often lead to sub-optimal performance due to the shift in data distribution. This paper proposes a new meta-transfer learning framework that automatically estimates the similarity amongst entities to transfer knowledge from well-observed entities to unmonitored entities. A sequence autoencoder embeds temporal behaviors of time series data and simulations generated by traditional physics-based models. This embedding model is trained in a meta-transfer learning framework under the guidance of source-to-source transferring experiences. We tested this method in streamflow prediction for multiple river segments in the Delaware River Basin, an ecologically diverse region along the eastern coast of the United States. The experimental results demonstrate the superiority of the proposed method in predicting streamflow for unmonitored stream segments compared to a diverse set of baselines. Our method also creates meaningful similarity estimates amongst segments to guide the transfer learning process.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121393930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Making Reconstruction-based Method Great Again for Video Anomaly Detection 使基于重构的方法在视频异常检测中再次发挥重要作用
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00157
Yizhou Wang, Can Qin, Yue Bai, Yi Xu, Xu Ma, Yun Fu
{"title":"Making Reconstruction-based Method Great Again for Video Anomaly Detection","authors":"Yizhou Wang, Can Qin, Yue Bai, Yi Xu, Xu Ma, Yun Fu","doi":"10.1109/ICDM54844.2022.00157","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00157","url":null,"abstract":"Anomaly detection in videos is a significant yet challenging problem. Previous approaches based on deep neural networks employ either reconstruction-based or prediction-based approaches. Nevertheless, existing reconstruction-based methods 1) rely on old-fashioned convolutional autoencoders and are poor at modeling temporal dependency; 2) are prone to overfit the training samples, leading to indistinguishable reconstruction errors of normal and abnormal frames during the inference phase. To address such issues, firstly, we get inspiration from transformer and propose Spatio-Temporal Auto-Trans-Encoder, dubbed as STATE, as a new autoencoder model for enhanced consecutive frame reconstruction. Our STATE is equipped with a specifically designed learnable convolutional attention module for efficient temporal learning and reasoning. Secondly, we put forward a novel reconstruction-based input perturbation technique during testing to further differentiate anomalous frames. With the same perturbation magnitude, the testing reconstruction error of the normal frames lowers more than that of the abnormal frames, which contributes to mitigating the overfitting problem of reconstruction. Owing to the high relevance of the frame abnormality and the objects in the frame, we conduct object-level reconstruction using both the raw frame and the corresponding optical flow patches. Finally, the anomaly score is designed based on the combination of the raw and motion reconstruction errors using perturbed inputs. Extensive experiments on benchmark video anomaly detection datasets demonstrate that our approach outperforms previous reconstruction-based methods by a notable margin, and achieves state-of-the-art anomaly detection performance consistently. The code is available at https://github.com/wyzjack/MRMGA4VAD.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114710669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Causality Enhanced Societal Event Forecasting With Heterogeneous Graph Learning 因果关系增强异质图学习的社会事件预测
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00019
Songgaojun Deng, H. Rangwala, Yue Ning
{"title":"Causality Enhanced Societal Event Forecasting With Heterogeneous Graph Learning","authors":"Songgaojun Deng, H. Rangwala, Yue Ning","doi":"10.1109/ICDM54844.2022.00019","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00019","url":null,"abstract":"Using observational event data to forecast societal events has been extensively studied in data-driven models. Prior work focuses on correlational analysis and ignores the importance of causal relationships behind events. Understanding the causality of events helps one infer future events by pinpointing potential triggers. In light of complex and dynamic social environments, it is difficult to comprehensively analyze the causes of societal events. In this work, we study the causal relationship between topics and events where topics are extracted from event-related documents. These topics represent probability distributions of words. We introduce a method to discover topics that have a causal effect on future events of interest. Next, we propose a causality-enhanced dynamic heterogeneous graph learning framework where topics, documents, and words are represented as nodes with changing edges. To handle the temporal dependencies of dynamic graphs, we introduce a temporal information learning module that updates node representations based on their evolving context and heterogeneous semantics. We conduct extensive experiments on four real-world datasets and demonstrate the effectiveness of our method in societal event prediction.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126242094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Homology-Separating Triangulated Euler Characteristic Curve 同调分离三角欧拉特征曲线
2022 IEEE International Conference on Data Mining (ICDM) Pub Date : 2022-11-01 DOI: 10.1109/ICDM54844.2022.00136
Nicholas O. Malott, R. Lewis, P. Wilsey
{"title":"Homology-Separating Triangulated Euler Characteristic Curve","authors":"Nicholas O. Malott, R. Lewis, P. Wilsey","doi":"10.1109/ICDM54844.2022.00136","DOIUrl":"https://doi.org/10.1109/ICDM54844.2022.00136","url":null,"abstract":"Topological Data Analysis (TDA) utilizes concepts from topology to analyze data. In general, TDA considers objects similar based on a topological invariant. Topological invariants are properties of the topological space that are homeomorphic; resilient to deformation in the space. The Euler-Poincaré Characteristic is a classic topological invariant that represents the alternating sum of the vertices, edges, faces, and higherorder cells of a closed surface. Tracking the Euler characteristic over a topological filtration produces an Euler Characteristic Curve (ECC). This study introduces a computational technique to determine the ECC of $mathbb{R}^{2}$ or $mathbb{R}^{3}$ data; the technique generalizes to higher dimensions. This technique separates landscapes of lowerorder homologies utilizing triangulations of the space.","PeriodicalId":433588,"journal":{"name":"2022 IEEE International Conference on Data Mining (ICDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127966798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书