default search action
Knowledge and Information Systems, Volume 43
Volume 43, Number 1, April 2015
- Diane Oyen, Terran Lane:
Transfer learning for Bayesian discovery of multiple Bayesian networks. 1-28 - Jin Xiao, Yi Xiao, Anqiang Huang, Dunhu Liu, Shouyang Wang:
Feature-selection-based dynamic transfer ensemble model for customer churn prediction. 29-51 - Forrest Briggs, Xiaoli Z. Fern, Raviv Raich:
Context-aware MIML instance annotation: exploiting label correlations with classifier chains. 53-79 - Guo-Xian Yu, Guoji Zhang, Zili Zhang, Zhiwen Yu, Lin Deng:
Semi-supervised classification based on subspace sparse representation. 81-101 - Ping Li, Jiajun Bu, Lijun Zhang, Chun Chen:
Graph-based local concept coordinate factorization. 103-126 - Jayakrushna Sahoo, Ashok Kumar Das, Adrijit Goswami:
An effective association rule mining scheme using a new generic basis. 127-156 - David Ryan Koes, Carlos J. Camacho:
Indexing volumetric shapes with matching and packing. 157-180 - Jian Chen, Jin Huang, Zeyi Wen, Zhen He, Kerry Taylor, Rui Zhang:
Analysis and evaluation of the top-k most influential location selection query. 181-217 - Mohammad Ebrahimi, Seyed Mohammad Taghi Rouhani Rankoohi:
An ant-based approach to cluster peers in P2P database systems. 219-247
Volume 43, Number 2, May 2015
- Mehdi Kargar, Aijun An:
Finding top-k, r-cliques for keyword search from graphs in polynomial delay. 249-280 - Yuan Ping, Yun Feng Chang, Yajian Zhou, Yingjie Tian, Yixian Yang, Zhili Zhang:
Fast and scalable support vector clustering for large-scale data analysis. 281-310 - Carlos Gañán, Jorge Mata-Díaz, Jose L. Muñoz, Oscar Esparza, Juanjo Alins:
A model for revocation forecasting in public-key infrastructures. 311-331 - Lei Shi, Aryya Gangopadhyay, Vandana P. Janeja:
STenSr: Spatio-temporal tensor streams for anomaly detection and pattern discovery. 333-353 - Xixian Han, Jianzhong Li, Hong Gao, Chengyu Yang:
SEPT: an efficient skyline join algorithm on massive data. 355-388 - Tom Chao Zhou, Michael Rung-Tsong Lyu, Irwin King, Jie Lou:
Learning to suggest questions in social media. 389-416 - Qi Yu:
CloudRec: a framework for personalized service Recommendation in the Cloud. 417-443 - Tony Ohmann, Imad Rahal:
Efficient clustering-based source code plagiarism detection using PIY. 445-472 - Jian Liu, Zong Min Ma, Xue Feng:
Answering ordered tree pattern queries over fuzzy XML data. 473-495
Volume 43, Number 3, June 2015
- Trong Dinh Thac Do, Alexandre Termier, Anne Laurent, Benjamin Négrevergne, Behrooz Omidvar-Tehrani, Sihem Amer-Yahia:
PGLCM: efficient parallel mining of closed frequent gradual itemsets. 497-527 - Yuanfeng Song, Wilfred Ng, Kenneth Wai-Ting Leung, Qiong Fang:
SFP-Rank: significant frequent pattern analysis for effective ranking. 529-553 - Truyen Tran, Dinh Q. Phung, Wei Luo, Svetha Venkatesh:
Stabilized sparse ordinal regression for medical risk stratification. 555-582 - Ahmad Khan, M. Arfan Jaffar, Ling Shao:
A modified adaptive differential evolution algorithm for color image segmentation. 583-597 - Guandong Xu, Zongda Wu, Guiling Li, Enhong Chen:
Improving contextual advertising matching by using Wikipedia thesaurus knowledge. 599-631 - Xiangrong Zhang, Yudi He, Licheng Jiao, Ruochen Liu, Jie Feng, Sisi Zhou:
Scaling cut criterion-based discriminant analysis for supervised dimension reduction. 633-655 - Eliahu Khalastchi, Meir Kalech, Gal A. Kaminka, Raz Lin:
Online data-driven anomaly detection in autonomous robots. 657-688 - Xixian Han, Jianzhong Li, Hong Gao:
TDEP: efficiently processing top-k dominating query on massive data. 689-718 - Saeedeh Aghamahmoodi, Seyed Mohammad Taghi Rouhani Rankoohi, Fatemeh Aghamahmoodi:
A new ant colony optimization-based algorithm for range query answering problem in relational schema-based P2P database systems. 719-749
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.