default search action
Knowledge and Information Systems, Volume 48
Volume 48, Number 1, July 2016
- Yasir Mehmood, Nicola Barbieri, Francesco Bonchi:
Modeling adoptions and the stages of the diffusion of innovations. 1-27 - Jia Wu, Zhibin Hong, Shirui Pan, Xingquan Zhu, Zhihua Cai, Chengqi Zhang:
Multi-graph-view subgraph mining for graph classification. 29-54 - Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe:
A compression method of double-array structures using linear functions. 55-80 - Yihuang Kang, Vladimir Zadorozhny:
Process monitoring using maximum sequence divergence. 81-109 - Wenjia Niu, Endong Tong, Qian Li, Gang Li, Xuemin Wen, Jianlong Tan, Li Guo:
Exploring probabilistic follow relationship to prevent collusive peer-to-peer piracy. 111-141 - Wangqun Lin, Philip S. Yu, Yuchen Zhao, Bo Deng:
Multi-type clustering in heterogeneous information networks. 143-178 - Sara Elena Garza Villarreal, Satu Elisa Schaeffer:
Local bilateral clustering for identifying research topics and groups from bibliographical data. 179-199 - Samir Al-Stouhi, Chandan K. Reddy:
Transfer learning for class imbalance problems with inadequate data. 201-228 - Parisutham Nirmala, Lekshmi Ramasubramony Sulochana, Nadarajan Rethnasamy:
Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. 229-252
Volume 48, Number 2, August 2016
- Hossein Hamooni, Abdullah Mueen, Amy Neel:
Phoneme sequence recognition via DTW-based classification. 253-275 - Gheorghi Guzun, Guadalupe Canahuate:
Performance evaluation of word-aligned compression methods for bitmap indices. 277-304 - Weidong Zhao, Haitao Liu, Weihui Dai, Jian Ma:
An entropy-based clustering ensemble method to support resource allocation in business process management. 305-330 - Zoltan Geler, Vladimir Kurbalija, Milos Radovanovic, Mirjana Ivanovic:
Comparison of different weighting schemes for the kNN classifier on time-series data. 331-378 - Yuan Zuo, Jichang Zhao, Ke Xu:
Word network topic model: a simple but general solution for short and imbalanced texts. 379-398 - Meng Jiang, Peng Cui, Alex Beutel, Christos Faloutsos, Shiqiang Yang:
Inferring lockstep behavior from connectivity pattern in large graphs. 399-428 - Fabio Fumarola, Pasqua Fabiana Lanotte, Michelangelo Ceci, Donato Malerba:
CloFAST: closed sequential pattern mining using sparse and vertical id-lists. 429-463 - Fethi Fkih, Mohamed Nazih Omri:
IRAFCA: an O(n) information retrieval algorithm based on formal concept analysis. 465-491 - Luca Rubini, Rossella Cancelliere, Patrick Gallinari, Andrea Grosso:
Local search and pseudoinversion: an hybrid approach to neural network training. 493-503
Volume 48, Number 3, September 2016
- Zeineb Chelly, Zied Elouedi:
A survey of the dendritic cell algorithm. 505-535 - Amine Trabelsi, Osmar R. Zaïane:
Mining contentious documents. 537-560 - Rami Al-Hmouz, Witold Pedrycz:
Models of time series with time granulation. 561-580 - Jan Tozicka, Jan Jakubuv, Antonín Komenda, Michal Pechoucek:
Privacy-concerned multiagent planning. 581-618 - Giuseppe Marra, Domenico Ursino, Francesco Ricca, Giorgio Terracina:
Information diffusion in a multi-social-network scenario: framework and ASP-based analysis. 619-648 - Xiaoning Xu, Chuancong Gao, Jian Pei, Ke Wang, Abdullah Al-Barakati:
Continuous similarity search for evolving queries. 649-678 - Jin-Woo Park, Mu-Woong Lee, Jinhan Kim, Seung-won Hwang, Sunghun Kim:
Cost-aware triage ranking algorithms for bug reporting systems. 679-705 - Shiyu Chang, Guo-Jun Qi, Yingzhen Yang, Charu C. Aggarwal, Jiayu Zhou, Meng Wang, Thomas S. Huang:
Large-scale supervised similarity learning in networks. 707-740 - Saif-Ur Rehman, Jawad Ashraf, Asad Habib, Abdus Salam:
Top-K Miner: top-K identical frequent itemsets discovery without user support threshold. 741-762
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.