default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKnowledge and Information Systems, Volume 50
Volume 50, Number 1, January 2017
- Saber Salah, Reza Akbarinia, Florent Masseglia:
A highly scalable parallel algorithm for maximally informative k-itemset mining. 1-26 - Aalaa Mojahed
, Beatriz de la Iglesia:
An adaptive version of k-medoids to deal with the uncertainty in clustering heterogeneous data using an intermediary fusion approach. 27-52 - Shirui Pan, Jia Wu, Xingquan Zhu, Guodong Long, Chengqi Zhang:
Boosting for graph classification with universum. 53-77 - Mahsa Orang, Nematollaah Shiri:
Correlation analysis techniques for uncertain time series. 79-116 - Barbaros Yet, Zane B. Perkins, Nigel R. M. Tai, D. William R. Marsh:
Clinical evidence framework for Bayesian networks. 117-143 - Arun Chauhan, Krishna Kummamuru, Durga Toshniwal:
Prediction of places of visit using tweets. 145-166 - Géraud Fokou, Stéphane Jean, Allel Hadjali, Mickaël Baron:
Handling failing RDF queries: from diagnosis to relaxation. 167-195 - Zhaonian Zou, Rong Zhu:
Truss decomposition of uncertain graphs. 197-230 - Ozgur Sanli, Ibrahim Korpeoglu, Adnan Yazici:
Rule-based inference and decomposition for distributed in-network processing in wireless sensor networks. 231-264 - Gloria Cerasela Crisan, Camelia-Mihaela Pintea, Vasile Palade:
Emergency management using geographic information systems: application to the first Romanian traveling salesman problem instance. 265-285 - Ramzi A. Haraty, Mohamed El Sai:
Information warfare: a lightweight matrix-based approach for database recovery. 287-313 - Artur Caetano, Gonçalo Antunes, João Pombinho, Marzieh Bakhshandeh, José Granjo, José Borbinha, Miguel Mira da Silva:
Representation and analysis of enterprise models with semantic techniques: an application to ArchiMate, e3value and business model canvas. 315-346
Volume 50, Number 2, February 2017
- Abdullah Yousafzai, Abdullah Gani, Rafidah Md Noor, Mehdi Sookhak, Hamid Talebian, Muhammad Shiraz, Muhammad Khurram Khan:
Cloud resource allocation schemes: review, taxonomy, and opportunities. 347-381 - Yanchi Liu, Chuanren Liu, Nicholas Jing Yuan, Lian Duan, Yanjie Fu, Hui Xiong, Songhua Xu, Junjie Wu:
Intelligent bus routing with heterogeneous human mobility patterns. 383-415 - Brigitte Boden, Stephan Günnemann, Holger Hoffmann, Thomas Seidl:
MiMAG: mining coherent subgraphs in multi-layer graphs with edge labels. 417-446 - Jordi Casas-Roma, Jordi Herrera-Joancomartí, Vicenç Torra:
k-Degree anonymity and edge selection: improving data utility in large networks. 447-474 - Shenglei Chen, Ana M. Martínez, Geoffrey I. Webb, Limin Wang:
Selective AnDE for large data learning: a low-bias memory constrained approach. 475-503 - Christina Lantzaki, Panagiotis Papadakos, Anastasia Analyti, Yannis Tzitzikas:
Radius-aware approximate blank node matching using signatures. 505-542 - Frédéric Ros, Serge Guillaume:
DIDES: a fast and effective sampling for clustering algorithm. 543-568 - Claude Pasquier, Frédéric Flouvat, Jérémy Sanhes, Nazha Selmaoui-Folcher:
Attributed graph mining in the presence of automorphism. 569-584 - Jafar Tahmoresnezhad, Sattar Hashemi:
Visual domain adaptation via transfer feature learning. 585-605 - M. H. Fazel Zarandi, F. Shabany Moghadam:
Fuzzy knowledge-based token-ordering policies for bullwhip effect management in supply chains. 607-631 - Linyun Yu, Peng Cui, Fei Wang, Chaoming Song, Shiqiang Yang:
Uncovering and predicting the dynamic process of information cascades with survival model. 633-659 - Eladio Domínguez, Beatriz Pérez, Ángel Luis Rubio, María Antonia Zapata, Alberto Allué, Antonio López:
Developing provenance-aware query systems: an occurrence-centric approach. 661-688
Volume 50, Number 3, March 2017
- Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, Nick G. Duffield, Theodore L. Willke:
Graphlet decomposition: framework, algorithms, and applications. 689-722 - Rong Zhu, Zhaonian Zou, Jianzhong Li:
Towards efficient top-k reliability search on uncertain graphs. 723-750 - Btihal El Ghali, Abderrahim El Qadi:
Context-aware query expansion method using Language Models and Latent Semantic Analyses. 751-762 - Ngo Van Linh, Nguyen Kim Anh, Khoat Than, Chien Nguyen Dang:
An effective and interpretable method for document classification. 763-793 - Chaoqun Li, Liangxiao Jiang, Hongwei Li, Jia Wu, Peng Zhang:
Toward value difference metric with attribute weighting. 795-825 - Chumphol Bunkhumpornpat, Krung Sinapiromsaran:
DBMUTE: density-based majority under-sampling technique. 827-850 - Vasudha Bhatnagar, Sharanjit Kaur, Rakhi Saxena, Dhriti Khanna:
DASC: data aware algorithm for scalable clustering. 851-881 - Xiangfu Meng, Longbing Cao, Xiaoyan Zhang, Jingyu Shao:
Top-k coupled keyword recommendation for relational keyword queries. 883-916 - Caner Komurlu, Jinjian Shao, Banu Akar, Elif S. Bayrak, Eric M. Brey, Ali Cinar, Mustafa Bilgic:
Active inference for dynamic Bayesian networks with an application to tissue engineering. 917-943 - Luís Marujo, Ricardo Ribeiro, Anatole Gershman, David Martins de Matos, João Paulo Neto, Jaime G. Carbonell:
Event-based summarization using a centrality-as-relevance model. 945-968 - Yusheng Xie, Zhengzhang Chen, Diana Palsetia, Goce Trajcevski, Ankit Agrawal, Alok N. Choudhary:
SILVERBACK+: scalable association mining via fast list intersection for columnar social data. 969-997 - Luciano H. Tamargo, Sebastian Gottifredi, Alejandro Javier García, Guillermo Ricardo Simari:
Sharing beliefs among agents with different degrees of credibility. 999-1031
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.
last updated on 2026-07-09 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
