default search action
Data Mining and Knowledge Discovery, Volume 30
Volume 30, Number 1, January 2016
- Mijung Kim, K. Selçuk Candan:
Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and tucker decompositions. 1-46 - Wouter Duivesteijn, Ad Feelders, Arno J. Knobbe
:
Exceptional Model Mining - Supervised descriptive local pattern mining with complex target concepts. 47-98 - Ming Gao, Ee-Peng Lim
On detecting maximal quasi antagonistic communities in signed graphs. 99-146 - Ismail Günes, Sule Gündüz Ögüdücü, Zehra Çataltepe:
Link prediction using time series of neighborhood-based node similarity scores. 147-180 - Geng Li, Mohammed J. Zaki
Sampling frequent and minimal boolean patterns: theory and application in classification. 181-225 - Kristina Ibáñez
A computational approach inspired by simulated annealing to study the stability of protein interaction networks in cancer and neurological disorders. 226-242 - Jesin Zakaria, Abdullah Mueen, Eamonn J. Keogh, Neal E. Young
Accelerating the discovery of unsupervised-shapelets. 243-281
Volume 30, Number 2, March 2016
- Rohit J. Kate:
Using dynamic time warping distances as features for improved time series classification. 283-312 - Gitte Vanwinckelen, Vinicius Tragante do Ó
Instance-level accuracy versus bag-level accuracy in multi-instance learning. 313-341 - Balázs Hidasi
General factorization framework for context-aware recommendations. 342-371 - Giovanni Stilo, Paola Velardi
Efficient temporal mining of micro-blog texts and its application to event discovery. 372-402 - Bing Hu, Yanping Chen, Eamonn J. Keogh:
Classification of streaming time series under more realistic assumptions. 403-437 - Matteo Riondato
Fast approximation of betweenness centrality through sampling. 438-475 - Mustafa Gökçe Baydogan
Time series representation and similarity based on local autopatterns. 476-509
Volume 30, Number 3, May 2016
- Meng Fang, Jie Yin, Xingquan Zhu
Active exploration for large graphs. 511-549 - Jia Zhu
Exploiting link structure for web page genre identification. 550-575 - Inmaculada Pérez-Bernabé, Antonio Fernández, Rafael Rumí
Parameter learning in hybrid Bayesian networks using prior knowledge. 576-604 - Reza Mortazavi
Enhancing aggregation phase of microaggregation methods for interval disclosure risk minimization. 605-639 - Elaine Ribeiro de Faria
MINAS: multiclass learning algorithm for novelty detection in data streams. 640-680 - Liangzhe Chen
Syndromic surveillance of Flu on Twitter using weakly supervised temporal topic models. 681-710 - Florian Lemmerich, Martin Atzmueller, Frank Puppe:
Fast exhaustive subgroup discovery with numerical target concepts. 711-762
Volume 30, Number 4, July 2016
- Roger M. Stein:
Evaluating discrete choice prediction models when the evaluation data is corrupted: analytic results and bias corrections for the area under the ROC. 763-796 - Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura
Identifying correlated heavy-hitters in a two-dimensional data stream. 797-818 - Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, Ümit V. Çatalyürek:
SONIC: streaming overlapping community detection. 819-847 - José Hernández-Orallo, César Ferri
Binarised regression tasks: methods and evaluation metrics. 848-890 - Guilherme Oliveira Campos, Arthur Zimek
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study. 891-927 - An-Shu Zhang
Mining significant association rules from uncertain data. 928-963 - Geoffrey I. Webb
Characterizing concept drift. 964-994
Volume 30, Number 5, September 2016
- Thomas Gärtner, Mirco Nanni, Andrea Passerini
Guest editors' introduction to the EcmlPkdd 2016 journal track special issue of Machine Learning. 995-997 - Yan Zhu
Irrevocable-choice algorithms for sampling from a stream. 998-1023 - Nilothpal Talukder, Mohammed J. Zaki
A distributed approach for graph mining in massive networks. 1024-1052 - Isak Karlsson
Generalized random shapelet forests. 1053-1085 - François Petitjean
Skopus: Mining top-k sequential patterns under leverage. 1086-1111 - Jussi Korpela
Using regression makes extraction of shared variation in multiple datasets easy. 1112-1133 - Esther Galbrun, Aristides Gionis, Nikolaj Tatti
Top-k overlapping densest subgraphs. 1134-1165 - Cheng Luo, Xiongcai Cai:
Bayesian Wishart matrix factorization. 1166-1191 - Luís Paulo F. Garcia, Ana Carolina Lorena, Stan Matwin
Ensembles of label noise filters: a ranking approach. 1192-1216 - Kai Zhu, Zhen Chen, Lei Ying
Locating the contagion source in networks with partial timestamps. 1217-1248 - Mostafa Haghir Chehreghani
Mining rooted ordered trees under subtree homeomorphism. 1249-1272 - Patrick Schäfer:
Scalable time series classification. 1273-1298 - Geert Heyman, Ivan Vulic, Marie-Francine Moens:
C-BiLDA extracting cross-lingual topics from non-parallel texts by distinguishing shared from unshared content. 1299-1323 - Marian-Andrei Rizoiu
ClusPath: a temporal-driven clustering to infer typical evolution paths. 1324-1349 - Sofiane Lagraa, Hamida Seba:
An efficient exact algorithm for triangle listing in large graphs. 1350-1369 - Michiel Stock, Krzysztof Dembczynski
Exact and efficient top-K inference for multi-target prediction by querying separable linear relational models. 1370-1394 - Hau Chan, Leman Akoglu:
Optimizing network robustness by edge rewiring: a general framework. 1395-1425
Volume 30, Number 6, November 2016
- Michael Jones
Exemplar learning for extremely efficient anomaly detection in real-valued time series. 1427-1454 - Yi Gao, Wenxin Jiang, Martin A. Tanner:
Generalized Gini Correlation and its Application in Data-Mining. 1455-1479 - Fernando Terroso-Saenz
Online route prediction based on clustering of meaningful velocity-change areas. 1480-1519 - Xuan Vinh Nguyen
Discovering outlying aspects in large datasets. 1520-1555
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 2024-11-05 20:49 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: