暂无分享,去创建一个
Nick Koudas | Abolfazl Asudeh | Gautam Das | Azade Nazi | N. Koudas | Gautam Das | Azade Nazi | Abolfazl Asudeh
[1] H. Mannila,et al. Discovering all most specific sentences , 2003, TODS.
[2] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[3] Christoph Witzgall. Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .
[4] Manon Arcand,et al. Collaborative Consumption or the Rise of the Two-Sided Consumer , 2016 .
[5] Gerhard J. Woeginger,et al. The quadratic 0-1 knapsack problem with series-parallel support , 2002, Oper. Res. Lett..
[6] T. Selkar,et al. Context-aware design and interaction in computer systems , 2000 .
[7] Vagelis Hristidis,et al. Leveraging collaborative tagging for web item design , 2011, KDD.
[8] Heikki Mannila,et al. Determining Attributes to Maximize Visibility of Objects , 2009, IEEE Transactions on Knowledge and Data Engineering.
[9] John N. Tsitsiklis,et al. Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..
[10] Loïck Lhote,et al. Average number of frequent (closed) patterns in Bernoulli and Markovian databases , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Allan D. Shocker,et al. A Consumer-Based Methodology for the Identification of New Product Ideas , 1974 .
[13] Bart Goethals,et al. Tight upper bounds on the number of candidate patterns , 2005, TODS.
[14] Ted Selker,et al. Context-aware design and interaction in computer systems , 2000, IBM Syst. J..
[15] Sönke Albers,et al. Optimal Product Attributes in Single Choice Models , 1980 .
[16] Moran Feldman,et al. Constrained Monotone Function Maximization and the Supermodular Degree , 2014, APPROX-RANDOM.
[17] Abolfazl Asudeh,et al. Query Reranking As A Service , 2016, Proc. VLDB Endow..
[18] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.