Automatic subspace clustering of high dimensional data for data mining applications, 1998. ,
Mining association rules between sets of items in large databases, SIGMOD, pp.207-216, 1993. ,
Interactive pattern mining on hidden data, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.95-104, 2012. ,
DOI : 10.1145/2396761.2396777
One click mining, Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, IDEA '13, 2013. ,
DOI : 10.1145/2501511.2501517
ExAnte: Anticipated Data Reduction in Constrained Pattern Mining, PKDD, pp.59-70, 2003. ,
DOI : 10.1007/978-3-540-39804-2_8
URL : http://it.geocities.com/alessio_mazzanti/Articoli/ExAntePKDD03.pdf
DualMiner, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.42-51, 2002. ,
DOI : 10.1145/775047.775054
Whom to ask?, Proceedings of the VLDB Endowment, vol.5, issue.11, 2012. ,
DOI : 10.14778/2350229.2350264
The use of MMR, diversity-based reranking for reordering documents and producing summaries, Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '98, pp.335-336, 1998. ,
DOI : 10.1145/290941.291025
Query steering for interactive data exploration, CIDR, 2013. ,
Intent-based diversification of web search results: metrics and algorithms, Information Retrieval, vol.14, issue.6, pp.572-592, 2011. ,
The Dense k -Subgraph Problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001. ,
DOI : 10.1007/s004530010050
URL : http://www.openu.ac.il/Personal_sites/download/accepted.ps
Discretizing continuous attributes while learning bayesian networks, ICML, pp.157-165, 1996. ,
Interestingness measures for data mining, ACM Computing Surveys, vol.38, issue.3, p.9, 2006. ,
DOI : 10.1145/1132960.1132963
MIME, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.634-637, 2011. ,
DOI : 10.1145/2020408.2020529
Composable core-sets for diversity and coverage maximization, Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '14, pp.100-108, 2014. ,
DOI : 10.1145/2594538.2594560
Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing, pp.38-49, 1973. ,
DOI : 10.1145/800125.804034
Strategy-based interactive cluster visualization for information retrieval, International Journal on Digital Libraries, vol.3, issue.2, pp.170-184, 2000. ,
DOI : 10.1007/s007999900016
Towards a framework for semantic exploration of frequent patterns ,
Redescription mining: Structure theory and algorithms, Proc. AAAI'05, pp.837-844, 2005. ,
WiFIsViz: Effective Visualization of Frequent Itemsets, 2008 Eighth IEEE International Conference on Data Mining, 2008. ,
DOI : 10.1109/ICDM.2008.93
URL : http://hci.cs.umanitoba.ca/assets/publication_files/2008-DataMining-Leung-WiFizViz.pdf
Item Sets That Compress, SDM, pp.393-404, 2006. ,
DOI : 10.1137/1.9781611972764.35
Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets, FIMI, 2004. ,
DOI : 10.1145/1133905.1133916
Automatic versus human navigation in information networks, ICWSM, 2012. ,