• Choose a category
• All
• Classic-Fiction

[Val87] Valduriez, P., Join indices, ACM Trans. Database Systems 12 (1987) 218–246.

[Vap95] Vapnik, V.N., The Nature of Statistical Learning Theory. (1995) Springer Verlag .

[Vap98] Vapnik, V.N., Statistical Learning Theory. (1998) John Wiley & Sons .

[VC71] Vapnik, V.N.; Chervonenkis, A.Y., On the uniform convergence of relative frequencies of events to their probabilities, Theory of Probability and Its Applications 16 (1971) 264–280.

[VC03] Vaidya, J.; Clifton, C., Privacy-preserving k-means clustering over vertically partitioned data, In: Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03) Washington, DC. (Aug 2003).

[VC06] Vuk, M.; Curk, T., ROC curve, lift chart and calibration plot, Metodološki zvezki 3 (2006) 89–108.

[VCZ10] Vaidya, J.; Clifton, C.W.; Zhu, Y.M., Privacy Preserving Data Mining. (2010) Springer, New York .

[VGK02] Vlachos, M.; Gunopulos, D.; Kollios, G., Discovering similar multidimensional trajectories, In: Proc. 2002 Int. Conf. Data Engineering (ICDE’02) San Fransisco, CA. (Apr. 2002), pp. 673–684.

[VMZ06] Veloso, A.; Meira, W.; Zaki, M., Lazy associative classificaiton, In: Proc. 2006 Int. Conf. Data Mining (ICDM’06) Hong Kong, China. (2006), pp. 645–654.

[vR90] van Rijsbergen, C.J., Information Retrieval. (1990) Butterworth .

[VWI98] Vitter, J.S.; Wang, M.; Iyer, B.R., Data cube approximation and histograms via wavelets, In: Proc. 1998 Int. Conf. Information and Knowledge Management (CIKM’98) Washington, DC. (Nov. 1998), pp. 96–104.

[Wat95] Waterman, M.S., Introduction to Computational Biology: Maps, Sequences, and Genomes (Interdisciplinary Statistics). (1995) CRC Press .

[Wat03] Watts, D.J., Six Degrees: The Science of a Connected Age. (2003) W. W. Norton & Company .

[WB98] Westphal, C.; Blaxton, T., Data Mining Solutions: Methods and Tools for Solving Real-World Problems. (1998) John Wiley & Sons .

[WCH10] Wu, T.; Chen, Y.; Han, J., Re-examination of interestingness measures in pattern mining: A unified framework, Data Mining and Knowledge Discovery 21 (3) (2010) 371–397.

[WCRS01] Wagstaff, K.; Cardie, C.; Rogers, S.; Schrödl, S., Constrained k-means clustering with background knowledge, In: Proc. 2001 Int. Conf. Machine Learning (ICML’01) Williamstown, MA. (June 2001), pp. 577–584.

[Wei04] Weiss, G.M., Mining with rarity: A unifying framework, SIGKDD Explorations 6 (2004) 7–19.

[WF94] Wasserman, S.; Faust, K., Social Network Analysis: Methods and Applications. (1994) Cambridge University Press .

[WF05] Witten, I.H.; Frank, E., Data Mining: Practical Machine Learning Tools and Techniques. 2nd ed. (2005) Morgan Kaufmann .

[WFH11] Witten, I.H.; Frank, E.; Hall, M.A., Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. 3rd ed. (2011) Morgan Kaufmann, Boston .

[WFYH03] Wang, H.; Fan, W.; Yu, P.S.; Han, J., Mining concept-drifting data streams using ensemble classifiers, In: Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03) Washington, DC. (Aug. 2003), pp. 226–235.

[WHH00] Wang, K.; He, Y.; Han, J., Mining frequent itemsets using support constraints, In: Proc. 2000 Int. Conf. Very Large Data Bases (VLDB’00) Cairo, Egypt. (Sept. 2000), pp. 43–52.

[WHJ+10] Wang, C.; Han, J.; Jia, Y.; Tang, J.; Zhang, D.; Yu, Y.; Guo, J., Mining advisor-advisee relationships from research publication networks, In: Proc. 2010 ACM SIGKDD Conf. Knowledge Discovery and Data Mining (KDD’10) Washington, DC. (July 2010).

[WHLT05] Wang, J.; Han, J.; Lu, Y.; Tzvetkov, P., TFP: An efficient algorithm for mining top-k frequent closed itemsets, IEEE Trans. Knowledge and Data Engineering 17 (2005) 652–664.

[WHP03] Wang, J.; Han, J.; Pei, J., CLOSET+: Searching for the best strategies for mining frequent closed itemsets, In: Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03) Washington, DC. (Aug. 2003), pp. 236–245.

[WI98] Weiss, S.M.; Indurkhya, N., Predictive Data Mining. (1998) Morgan Kaufmann