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

IEEE International Conference on Multimedia and Expo (ICME)

作者： Fei Tao Junbiao Pang Chunjie Zhang Liang Li Li Su Weigang Zhang Qingming Huang Guiping Su School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China College of Metropolitan Transportation Beijing University of Technology China Key Lab on Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China School of Computer Science and Technology Harbin Institute of Technology China

ISBN: (纸本)9781467372596

In web topic detection, detecting “hot” topics from enormous User-Generated Content (UGC) on web data poses two main difficulties that conventional approaches can barely handle: 1) poor feature representations from noisy images and short texts; and 2) uncertain roles of modalities where visual content is either highly or weakly relevant to textual cues due to less-constrained data. In this paper, following the detection by ranking approach, we address the problem by learning a robust shared representation from multiple, noisy and complementary features, and integrating both textual and visual graphs into a k-Nearest Neighbor Similarity Graph (k-N 2 SG). Then Non-negative Matrix Factorization using Random walk (NMFR) is introduced to generate topic candidates. An efficient fusion of multiple graphs is then done by a Latent Poisson Deconvolution (LPD) which consists of a poisson deconvolution with sparse basis similarities for each edge. Experiments show significantly improved accuracy of the proposed approach in comparison with the state-of-the-art methods on two public data sets.

关键词： Visualization Deconvolution Robustness Feature extraction Optimization Correlation Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Evaluating journals' yearly impact with altmetric indicators

引用

Chinese Journal of Library and Information Science 2015年第2期 25-38页

作者： Simon S.LI Fred Y.YE School of Information Management Nanjing University Jiangsu Key Lab of Data Engineering & Knowledge Service Nanjing University

Purpose： Applying SSCI journals of library and information science （LIS） as the research sample, we explore the feasibility of measuring academic journals＇ yearly social impact by using altmetric indicators. Design/methodology/approach： Using a sample of 66 SSCI joumals in LIS published in 2013, statistics regarding journal mentions in social media and other online tools were retrieved from *** and meanwhile citation data was also collected from JCR and Scopus. Based on the method of principal component analysis, data was analyzed for associations between the altmetric and traditional metrics to demonstrate the effect ofaltmetric indicators on measuring academic j oumals＇ yearly impact. Findings： The Spearman＇s rank correlation test results show that altmetric indicators and traditional citation counts were significantly correlated, indicating that altmetrics can be used to measure a journal＇s yearly social impact. Research limitations： The time frame of data collected from *** may not be consistent with that of JCR and Scopus citation data. Practical implications： A new method is provided based on altmetrics for evaluating the social impact of academic journals, which can be applied to design new indicators of short-term journal impact. Originality value： In this paper, we have established a method for evaluating the social impact of academic journals based on altmetric indictors. Altmetrics can be complementary to traditional citation metrics in assessing a journal＇s impact within a year or even in a shorter period of time.

关键词： Altmetrics Journal evaluation Informetrics Bibliometrics Principalcomponent analysis （PCA）

来源：评论

学校读者我要写书评

暂无评论

Competitive hopfield neural network with chaotic dynamics for partitional clustering problem

Competitive hopfield neural network with chaotic dynamics fo...

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Gang Yang Junyan Yi Jieping Xu Xirong Li Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (纸本)9781479983292

In this paper, an algorithm, named CCHN, is proposed to solve the partitional clustering problem. An outer chaotic mechanism with annealing strategy is introduced into the competitive Hopfield neural network to construct CCHN for expecting better opportunities of converging to the optimal solution. In addition to retain the competitive characteristics of the conventional competitive Hopfield neural network, CCHN displays a rich range of complex and flexible chaotic dynamics. The chaotic dynamics and the annealing strategy guarantee the powerful searching ability and the effective convergence of CCHN. Results simulated on clustering benchmark problems show that CCHN algorithm is more likely to find an optimal or near-optimal solution with a higher successful ratio than previous algorithms.

关键词： Clustering algorithms Partitioning algorithms Neurons Heuristic algorithms Convergence Neural networks Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

A study of SQL-on-Hadoop systems

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8807卷 154-166页

作者： Chen, Yueguo Qin, Xiongpai Bian, Haoqiong Chen, Jun Dong, Zhaoan Du, Xiaoyong Gao, Yanjie Liu, Dehai Lu, Jiaheng Zhang, Huijie Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing100872 China

ISBN: (纸本)9783319130200

Hadoop is now the de facto standard for storing and processing big data, not only for unstructured data but also for some structured data. As a result, providing SQL analysis functionality to the big data resided in HDFS becomes more and more important. Hive is a pioneer system that support SQL-like analysis to the data in HDFS. However, the performance of Hive is not satisfactory for many applications. This leads to the quick emergence of dozens of SQL-on-Hadoop systems that try to support interactive SQL query processing to the data stored in HDFS. This paper firstly gives a brief technical review on recent efforts of SQLon- Hadoop systems. Then we test and compare the performance of five representative SQL-on-Hadoop systems, based on some queries selected or derived from the TPC-DS benchmark. According to the results, we show that such systems can benefit more from the applications of many parallel query processing techniques that have been widely studied in the traditional MPP analytical databases. © Springer International Publishing Switzerland 2014.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Context-aware recommendation using GPU based parallel tensor decomposition

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 213-226页

作者： Zou, Benyou Lan, Mengwei Li, Cuiping Tan, Liwen Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China

Recommender system plays an important role in many practical applications that help users to deal with information overload and provide personalized recommendations to them. The context in which a choice is made has been recognized as an important factor for recommendation systems. Recently, researchers extend the classical matrix factorization and allows for a generic integration of contextual information by modeling the data as a tensor. However, current tensor factorization methods suffer from the limitation that the computing cost can be very high in practice. In this paper, we propose GALS, a GPU based parallel tensor factorization algorithm, to accelerate the tensor factorization on large data sets to support the efficient context-aware recommendation. Experiments show that the proposed method can achieve 10 times faster than the current tensor factorization methods. © Springer International Publishing Switzerland 2014.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Location-based recommendation using incremental tensor factorization model

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 227-238页

作者： Zou, Benyou Zou, Benyou Li, Cuiping Tan, Liwen Tan, Liwen Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China

Newly emerging location-based online social services, such as Meetup and Douban, have experienced increased popularity and rapid growth. The classical Matrix Factorization methods usually only consider the user-item matrix. Recently, Researchers have extended the matrix adding location context as a tensor and used the Tensor Factorization methods for this scenario. However, in real scenario, the users and events are changing over time, the classical Tensor Factorization methods suffers the limitation that it can only be applied for static settings. In this paper, we propose a general Incremental Tensor Factorization model, which models the appearance changes of a tensor by adaptively updating its previous factorized components rather than recomputing them on the whole data every time the data changed. Experiments show that the proposed methods can offer more effective recommendations than baselines, and significantly improve the efficiency of providing location recommendations. © Springer International Publishing Switzerland 2014.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: Global estimates on the number of people blind or visually impaired by cataract: a meta-analysis from 2000 to 2020

引用

Eye (London, England) 2024年第11期38卷 2229-2231页

作者： Konrad Pesudovs Hugh R. Taylor Tabassom Sedighi Rupert R. A. Bourne Shahina Pardhan Van Charles Lansingh John H. Kempen Ian Tapply Arthur G. Fernandes Maria Vittoria Cicinelli Alessandro Arrigo Nicolas Leveziel Serge Resnikoff Seth Flaxman Mukkharram M. Bikbov Tasanee Braithwaite Alain Bron Ching-Yu Cheng Monte A. Del Monte Joshua R. Ehrlich Leon B. Ellwein David Friedman João M. Furtado Gus Gazzard Ronnie George M. Elizabeth Hartnett Jost B. Jonas Rim Kahloun Moncef Khairallah Rohit C. Khanna Janet Leasher Julie-Anne Little Vinay Nangia Michal Nowak Tunde Peto Pradeep Ramulu Fotis Topouzis Mitiadis Tsilimbaris Ya Xing Wang Ningli Wang Paul Svitil Briant Theo Vos Katrin Burkart Kaleb Coberly Xiaochen Dai Stephen S. Lim Tomislav Mestrovic Ali H. Mokdad Christopher J. L. Murray Jaimie D. Steinmetz Awoke Misganaw Yohannes Habtegiorgis Abate Mohammad Abdollahi Mozhan Abdollahi Ayele Mamo Abebe Olumide Abiodun Richard Gyan Aboagye Woldu Aberhe Abrha Hasan Abualruz Hiwa Abubaker Ali Eman Abu-Gharbieh Salahdein Aburuz Tadele Girum Girum Adal Mesafint Molla Adane Isaac Yeboah Addo Qorinah Estiningtyas Sakilah Adnani Muhammad Sohail Afzal Muhammad Umair Shahin Aghamiri Bright Opoku Ahinkorah Aqeel Ahmad Sajjad Ahmad Ali Ahmadi Siamak Sabour Ayman Ahmed Haroon Ahmed Ahmad Samir Alfaar Abid Ali Syed Shujait Shujait Ali Awais Altaf Hubert Amu Emmanuel Manu Sofia Androudi Rodrigo Anguita Abhishek Anil Rimple Jeet Kaur Muhammad Aaqib Shamim Saeid Anvari Anayochukwu Edward Anyasodor Francis Appiah Jalal Arabloo Haleh Ayatollahi Mosab Arafat Damelash Areda Reza Arefnezhad Brhane Berhe Aregawi Akeza Awealom Asgedom Tahira Ashraf Seyyed Shamsadin Athari Bantalem Tilaye Tilaye Atinafu Birhan Tsegaw Taye Maha Moh’d Wahbi Atout Alok Atreya Ahmed Y. Azzam Hassan Babamohamadi Sara Bagherieh Yogesh Bahurupi Atif Amin Baig Shumaila Nargus Biswajit Banik Mainak Bardhan Saurav Basu Kavita Batra Nebiyou Simegnew Bayileyegn Fatemeh Bazvand Addisu Shunu Beyene Awoke Masrie Asrat Derese Devidas S. Bhagat Akshaya Srikanth Bhagavathula Pankaj Bh Medicine & Health University of New South Wales Sydney NSW Australia School of Optometry and Vision Science University of New South Wales Sydney NSW Australia School of Population and Global Health University of Melbourne Carlton VIC Australia Vision and Eye Research Institute Anglia Ruskin University Cambridge UK HelpMeSee Instituto Mexicano de Oftalmologia Santiago de Querétaro Mexico University of Miami Gables FL USA University of Utah Salt Lake City UT USA Chief Medical Office HelpMeSee New York NY USA Mexican Institute of Ophthalmology Queretaro Mexico Department of Ophthalmology Massachusetts Eye and Ear/Shepens Eye Research Institute/Harvard Medical School Boston MA USA Eye Unit MyungSung Christian Medical Center (MCM) Comprehensive Specialized Hospital and MyungSun Medical College Addis Ababa Ethiopia Department of Ophthalmology Addis Ababa University Addis Ababa Ethiopia Sight for Souls Bellevue WA USA Department of Ophthalmology Harvard University Boston MA USA Eye Unit MyungSung Medical College Addis Ababa Ethiopia Addenbrooke’s Hospital Cambridge UK Department of Ophthalmology Cambridge University Hospitals Cambridge UK Federal University of Sao Paolo Sao Paolo SP Brazil University of Calgary Calgary AB Canada Department of Ophthalmology and Visual Sciences Federal University of São Paulo Sao Paulo Brazil School of Medicine Vita-Salute San Raffaele University Milan Italy Department of Ophthalmology IRCCS San Raffaele Scientific Institute Milan Italy Department of Ophthalmology San Raffaele Scientific Institute Milano Italy IRCCS San Raffaele Scientific Institute Vita-Salute University Milan Italy Scientific Institute San Raffaele Hospital Vita-Salute University Milan Italy University of Poitiers Poitiers France CHU de Poitiers Poitiers France Ophthalmology Department CHU de Poitiers (Poitiers University Hospital) Poitiers France Unité 1084 National Institute of Health and Medical Research (INSERM) Poitiers France

来源：评论

学校读者我要写书评

暂无评论

Dense sampling of bird diversity increases power of comparative genomics (vol 587, pg 252, 2020)

引用

NATURE 2021年第7856期592卷 E24-E24页

作者： Feng, Shaohong Stiller, Josefin Deng, Yuan Armstrong, Joel Fang, Qi Reeve, Andrew Hart Xie, Duo Chen, Guangji Guo, Chunxue Faircloth, Brant C. Petersen, Bent Wang, Zongji Zhou, Qi Diekhans, Mark Chen, Wanjun Andreu-Sanchez, Sergio Margaryan, Ashot Howard, Jason Travis Parent, Carole Pacheco, George Sinding, Mikkel-Holger S. Puetz, Lara Cavill, Emily Ribeiro, Angela M. Eckhart, Leopold Fjeldsa, Jon Hosner, Peter A. Brumfield, Robb T. Christidis, Les Bertelsen, Mads F. Sicheritz-Ponten, Thomas Tietze, Dieter Thomas Robertson, Bruce C. Song, Gang Borgia, Gerald Claramunt, Santiago Lovette, Irby J. Cowen, Saul J. Njoroge, Peter Dumbacher, John Philip Ryder, Oliver A. Fuchs, Jerome Bunce, Michael Burt, David W. Cracraft, Joel Meng, Guanliang Hackett, Shannon J. Ryan, Peter G. Jonsson, Knud Andreas Jamieson, Ian G. da Fonseca, Rute R. Braun, Edward L. Houde, Peter Mirarab, Siavash Suh, Alexander Hansson, Bengt Ponnikas, Suvi Sigeman, Hanna Stervander, Martin Frandsen, Paul B. van der Zwan, Henriette van der Sluis, Rencia Visser, Carina Balakrishnan, Christopher N. Clark, Andrew G. Fitzpatrick, John W. Bowman, Reed Chen, Nancy Cloutier, Alison Sackton, Timothy B. Edwards, Scott V. Foote, Dustin J. Shakya, Subir B. Sheldon, Frederick H. Vignal, Alain Soares, Andre E. R. Shapiro, Beth Gonzalez-Solis, Jacob Ferrer-Obiol, Joan Rozas, Julio Riutort, Marta Tigano, Anna Friesen, Vicki Dalen, Love Urrutia, Araxi O. Szekely, Tamas Liu, Yang Campana, Michael G. Corvelo, Andre Fleischer, Robert C. Rutherford, Kim M. Gemmell, Neil J. Dussex, Nicolas Mouritsen, Henrik Thiele, Nadine Delmore, Kira Liedvogel, Miriam Franke, Andre Hoeppner, Marc P. Krone, Oliver Fudickar, Adam M. Mila, Borja Ketterson, Ellen D. Fidler, Andrew Eric Friis, Guillermo Parody-Merino, Angela M. Battley, Phil F. Cox, Murray P. Lima, Nicholas Costa Barroso Prosdocimi, Francisco Parchman, Thomas Lee Schlinger, Barney A. Loiselle, Bette A. Blake, John G. Lim, Haw Chuan Day, Lainy B. Fuxjager, Matthew J. Baldwin, Maude W. Braun, Michael J. Wirthlin, Morgan Dikow, China National GeneBank BGI-Shenzhen Shenzhen China State Key Laboratory of Genetic Resources and Evolution Kunming Institute of Zoology Chinese Academy of Sciences Kunming China BGI-Shenzhen Shenzhen China Villum Centre for Biodiversity Genomics Section for Ecology and Evolution Department of Biology University of Copenhagen Copenhagen Denmark BGI Education Center University of Chinese Academy of Sciences Shenzhen China MOE Laboratory of Biosystems Homeostasis and Protection Life Sciences Institute Zhejiang University Hangzhou China Department of Neuroscience and Developmental Biology University of Vienna Vienna Austria Center for Excellence in Animal Evolution and Genetics Chinese Academy of Sciences Kunming China James D. Watson Institute of Genome Sciences Hangzhou China UC Santa Cruz Genomics Institute UC Santa Cruz Santa Cruz CA USA Natural History Museum of Denmark University of Copenhagen Copenhagen Denmark Center for Macroecology Evolution and Climate GLOBE Institute University of Copenhagen Copenhagen Denmark Department of Biological Sciences Louisiana State University Baton Rouge LA USA Museum of Natural Science Louisiana State University Baton Rouge LA USA Centre of Excellence for Omics-Driven Computational Biodiscovery (COMBio) Faculty of Applied Sciences AIMST University Kedah Malaysia Section for Evolutionary Genomics The GLOBE Institute Faculty of Health and Medical Sciences University of Copenhagen Copenhagen Denmark Institute of Molecular Biology National Academy of Sciences Yerevan Armenia University Museum Norwegian University of Science and Technology Trondheim Norway Center for Reproductive Medicine The 2nd Affiliated Hospital School of Medicine Zhejiang University Hangzhou China Novogene Durham NC USA Duke University Medical Center Durham NC USA The Rockefeller University New York NY USA Howard Hughes Medical Institute Chevy Chase MD USA Department of Dermatology Medical University of Vienna Vienna Austria

来源：评论

学校读者我要写书评

暂无评论

A Secure Collusion-Aware and Probability-Aware Range Query Processing in Tiered Sensor Networks

A Secure Collusion-Aware and Probability-Aware Range Query P...

引用

Reliable Distributed Systems

作者： Lei Dong Xuan Chen Jianxiang Zhu Hong Chen Ke Wang Cuiping Li Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China School of Computing Science Simon Fraser University Burnaby BC Canada Key Lab. of Data Eng. & Knowledge Eng. of Minist. of Educ. Beijing China

With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an important part of Internet of Things (IoTs). It is challenging to process range query while protecting sensitive data from adversaries. Moreover, most existing work focuses on privacy-preserving range query neglecting collusion attacks and probability attacks, which are more threatening to network security. In this paper, we first propose a secure range query protocol called secRQ, which not only protects data privacy, but also resists collusion attacks and probability attacks in tiered wireless sensor networks. Generalized inverse matrices and distance-based range query mechanism are used to guarantee security as well as high efficiency and accuracy. Besides, we propose the mutual verification scheme to verify the integrity of query results. Finally, both theoretical analysis and experimental results confirm the security, efficiency and accuracy of secRQ.

关键词： Wireless sensor networks Protocols data privacy Biomedical monitoring Query processing Monitoring Heart rate

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm to building a fuzzy rough classifier 13

A fast algorithm to building a fuzzy rough classifier

引用

13th International Conference on Machine Learning and Cybernetics, ICMLC 2014

作者： Tsang, Eric C. C. Zhao, Suyun The Macau University of Science and Technology Taipa Macau China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing100872 China

ISBN: (纸本)9783662456514

In this paper, by strict mathematic reasoning, we discover the relation between the similarity relation and lower approximation. Based on this relation, we design a fast algorithm to build a rule based fuzzy rough classifier. Finally, the numerical experiments demonstrate the efficiency and the affectivity of the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：