Knowledge And Information Systems（KAIS ）的AUGUST 2016, ISSUE 2论文列表

卷期号： August 2016, issue 2

发布时间：

卷期年份： 2016

卷期官网： https://link.springer.com/journal/10115/volumes-and-issues/48-2

Phoneme sequence recognition via DTW-based classification

Performance evaluation of word-aligned compression methods for bitmap indices

An entropy-based clustering ensemble method to support resource allocation in business process management

Comparison of different weighting schemes for the kNN classifier on time-series data

Word network topic model: a simple but general solution for short and imbalanced texts

Inferring lockstep behavior from connectivity pattern in large graphs

CloFAST: closed sequential pattern mining using sparse and vertical id-lists

IRAFCA: an O(n) information retrieval algorithm based on formal concept analysis

Local search and pseudoinversion: an hybrid approach to neural network training

Modeling adoptions and the stages of the diffusion of innovations

Multi-graph-view subgraph mining for graph classification

A compression method of double-array structures using linear functions

Process monitoring using maximum sequence divergence

Exploring probabilistic follow relationship to prevent collusive peer-to-peer piracy

Multi-type clustering in heterogeneous information networks

Local bilateral clustering for identifying research topics and groups from bibliographical data

Transfer learning for class imbalance problems with inadequate data

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks

A survey of the dendritic cell algorithm

Mining contentious documents

Models of time series with time granulation

Privacy-concerned multiagent planning

Information diffusion in a multi-social-network scenario: framework and ASP-based analysis

Continuous similarity search for evolving queries

Cost-aware triage ranking algorithms for bug reporting systems

Large-scale supervised similarity learning in networks

Top-K Miner: top-K identical frequent itemsets discovery without user support threshold