首页期刊导航|机器智能研究（英文）
期刊信息/Journal information
机器智能研究（英文）
机器智能研究（英文）

谭铁牛　刘国平　胡豁生

双月刊

2731-538X

ijac@ia.ac.cn

010-62655893

100190

北京海淀区中关村东路95号2728信箱

机器智能研究（英文）/Journal Machine Intelligence ResearchCSCDCSTPCD北大核心EI
查看更多>>International Journal of Automation and computing is a publication of Institute of Automation, the Chinese Academy of Sciencs and Chinese Automation and computing Society in the United Kingdom. The Journal publishes papers on original theoretical and experimental research and development in automation and computing. The scope of the journal is extensive. Topics include; artificial intelligence, automatic control, bioinformatics, computer sciene, information technology, modeling and simulation, networks and communications, optimization and decision, pattern recognition, robotics, signal processing, and systems engineering.
正式出版
收录年代

    A Simple yet Effective Framework for Active Learning to Rank

    Qingzhong WangHaifang LiHaoyi XiongWen Wang...
    169-183页
    查看更多>>摘要：While China has become the largest online market in the world with approximately 1 billion internet users,Baidu runs the world's largest Chinese search engine serving more than hundreds of millions of daily active users and responding to billions of queries per day.To handle the diverse query requests from users at the web-scale,Baidu has made tremendous efforts in understanding users'queries,retrieving relevant content from a pool of trillions of webpages,and ranking the most relevant webpages on the top of the res-ults.Among the components used in Baidu search,learning to rank(LTR)plays a critical role and we need to timely label an extremely large number of queries together with relevant webpages to train and update the online LTR models.To reduce the costs and time con-sumption of query/webpage labelling,we study the problem of active learning to rank(active LTR)that selects unlabeled queries for an-notation and training in this work.Specifically,we first investigate the criterion-Ranking entropy(RE)characterizing the entropy of relevant webpages under a query produced by a sequence of online LTR models updated by different checkpoints,using a query-by-com-mittee(QBC)method.Then,we explore a new criterion namely prediction variances(PV)that measures the variance of prediction res-ults for all relevant webpages under a query.Our empirical studies find that RE may favor low-frequency queries from the pool for la-belling while PV prioritizes high-frequency queries more.Finally,we combine these two complementary criteria as the sample selection strategies for active learning.Extensive experiments with comparisons to baseline algorithms show that the proposed approach could train LTR models to achieve higher discounted cumulative gain(i.e.,the relative improvement ΔDCG4=1.38％)with the same budgeted labelling efforts.
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    Stability and Generalization of Hypergraph Collaborative Networks

    Michael K.NgHanrui WuAndy Yip
    184-196页
    查看更多>>摘要：Graph neural networks have been shown to be very effective in utilizing pairwise relationships across samples.Recently,there have been several successful proposals to generalize graph neural networks to hypergraph neural networks to exploit more com-plex relationships.In particular,the hypergraph collaborative networks yield superior results compared to other hypergraph neural net-works for various semi-supervised learning tasks.The collaborative network can provide high quality vertex embeddings and hyperedge embeddings together by formulating them as a joint optimization problem and by using their consistency in reconstructing the given hy-pergraph.In this paper,we aim to establish the algorithmic stability of the core layer of the collaborative network and provide generaliz-ation guarantees.The analysis sheds light on the design of hypergraph filters in collaborative networks,for instance,how the data and hypergraph filters should be scaled to achieve uniform stability of the learning process.Some experimental results on real-world datasets are presented to illustrate the theory.
      原文链接:
    • NETL
    • NSTL
    • 万方数据

    Boosting Multi-modal Ocular Recognition via Spatial Feature Reconstruction and Unsupervised Image Quality Estimation

    Zihui YanYunlong WangKunbo ZhangZhenan Sun...
    197-214页
    查看更多>>摘要：In the daily application of an iris-recognition-at-a-distance(IAAD)system,many ocular images of low quality are acquired.As the iris part of these images is often not qualified for the recognition requirements,the more accessible periocular regions are a good complement for recognition.To further boost the performance of IAAD systems,a novel end-to-end framework for multi-modal ocular recognition is proposed.The proposed framework mainly consists of iris/periocular feature extraction and matching,unsupervised iris quality assessment,and a score-level adaptive weighted fusion strategy.First,ocular feature reconstruction(OFR)is proposed to sparsely reconstruct each probe image by high-quality gallery images based on proper feature maps.Next,a brand new unsupervised iris quality assessment method based on random multiscale embedding robustness is proposed.Different from the existing iris quality assess-ment methods,the quality of an iris image is measured by its robustness in the embedding space.At last,the fusion strategy exploits the iris quality score as the fusion weight to coalesce the complementary information from the iris and periocular regions.Extensive experi-mental results on ocular datasets prove that the proposed method is obviously better than unimodal biometrics,and the fusion strategy can significantly improve the recognition performance.
      原文链接:
    • NETL
    • NSTL
    • 万方数据