Social Network Data Analytics, Springer, pp. 115–148. 2011.
-
M. Bilenko, S. Basu, and R. J. Mooney. Integrating constraints and metric learning in semi-supervised clustering. ICML Conference, 2004.
-
C. M. Bishop. Pattern recognition and machine learning. Springer, 2007.
-
C. M. Bishop. Neural networks for pattern recognition. Oxford University Press, 1995.
-
C. M. Bishop. Improving the generalization properties of radial basis function neural networks. Neural Computation, 3(4), pp. 579–588, 1991.
-
D. Blei, A. Ng, and M. Jordan. Latent dirichlet allocation. Journal of Machine Learn-ing Research, 3: pp. 993–1022, 2003.
-
D. Blei. Probabilistic topic models. Communications of the ACM, 55(4), pp. 77–84, 2012.
-
A. Blum, and T. Mitchell. Combining labeled and unlabeled data with co-training.
Proceedings of Conference on Computational Learning Theory, 1998.
-
A. Blum, and S. Chawla. Combining labeled and unlabeled data with graph mincuts.
ICML Conference, 2001.
-
C. Bohm, K. Haegler, N. Muller, and C. Plant. Coco: coding cost for parameter free outlier detection. ACM KDD Conference, 2009.
-
K. Borgwardt, and H.-P. Kriegel. Shortest-path kernels on graphs. IEEE International Conference on Data Mining, 2005.
-
S. Boriah, V. Chandola, and V. Kumar. Similarity measures for categorical data: A comparative evaluation. SIAM Conference on Data Mining, 2008.
-
L. Bottou, and V. Vapnik. Local learning algorithms. Neural Computation, 4(6), pp. 888–900, 1992.
-
L. Bottou, C. Cortes, J. S. Denker, H. Drucker, I. Guyon, L. Jackel, Y. LeCun, U. A. M¨uller, E. S¨ackinger, P. Simard, and V. Vapnik. Comparison of classifier methods: a case study in handwriting digit recognition. International Conference on Pattern Recognition, pp. 77–87, 1994.
-
J. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. Principles of Data Mining and Knowledge Discovery, pp. 75–85, 2000.
-
P. Bradley, and U. Fayyad. Refining initial points for k-means clustering. ICML Con-ference, pp. 91–99, 1998.
-
M. Breunig, H.-P. Kriegel, R. Ng, and J. Sander. LOF: Identifying density-based local outliers. ACM SIGMOD Conference, 2000.
-
L. Breiman, J. Friedman, C. Stone, and R. Olshen. Classification and regression trees.
CRC press, 1984.
-
L. Breiman. Random forests. Machine Learning, 45(1), pp. 5–32, 2001.
-
L. Breiman. Bagging predictors. Machine Learning, 24(2), pp. 123–140, 1996.
-
S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing associ-ation rules to correlations. ACM SIGMOD Conference, pp. 265–276, 1997.
-
S. Brin, and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1–7), pp. 107–117, 1998.
-
B. Bringmann, S. Nijssen, and A. Zimmermann. Pattern-based classification: A uni-fying perspective. arXiv preprint, arXiv:1111.6191, 2011.
-
C. Brodley, and P. Utgoff. Multivariate decision trees. Machine learning, 19(1), pp. 45– 77, 1995.
-
Y. Bu, L. Chen, A. W.-C. Fu, and D. Liu. Efficient anomaly monitoring over moving object trajectory streams. ACM KDD Conference, pp. 159–168, 2009.
-
M. Bulmer. Principles of Statistics. Dover Publications, 1979.
-
H. Bunke. On a relation between graph edit distance and maximum common sub-graph. Pattern Recognition Letters, 18(8), pp. 689–694, 1997.
-
H. Bunke, and K. Shearer. A graph distance metric based on the maximal common subgraph.Pattern recognition letters, 19(3), pp. 255–259, 1998.
-
W. Buntine. Learning Classification Trees. Artificial intelligence frontiers in statistics. Chapman and Hall, pp. 182–201, 1993.
-
T. Burnaby. On a method for character weighting a similarity coefficient employing the concept of information. Mathematical Geology, 2(1), 25–38, 1970.
-
D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algo-rithm for transactional databases. IEEE International Conference on Data Engineer-ing, pp. 443–452, 2001.
-
C. Burges. A tutorial on support vector machines for pattern recognition. Data mining and knowledge discovery, 2(2), pp. 121–167, 1998.
-
T. Calders, and B. Goethals. Mining all non-derivable frequent itemsets. Principles of Knowledge Discovery and Data Mining, pp. 74–86, 2002.
702 BIBLIOGRAPHY
-
T. Calders, C. Rigotti, and J. F. Boulicaut. A survey on condensed representations for frequent sets. In Constraint-based mining and inductive databases, pp. 64–80, Springer, 2006.
-
S. Chakrabarti. Mining the Web: Discovering knowledge from hypertext data. Morgan Kaufmann, 2003.
-
S. Chakrabarti, B. Dom, and P. Indyk. Enhanced hypertext categorization using hyperlinks. ACM SIGMOD Conference, pp. 307–318, 1998.
-
S. Chakrabarti, S. Sarawagi, and B. Dom. Mining surprising patterns using temporal description length. VLDB Conference, pp. 606–617, 1998.
-
K. P. Chan, and A. W. C. Fu. Efficient time series matching by wavelets.IEEE Inter-national Conference on Data Engineering, pp. 126–133, 1999.
-
V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection: A survey. ACM Com-puting Surveys, 41(3), 2009.
-
V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection for discrete sequences: A survey. IEEE Transactions on Knowledge and Data Engineering, 24(5), pp. 823–839, 2012.
-
O. Chapelle. Training a support vector machine in the primal. Neural Computation, 19(5), pp. 1155–1178, 2007.
-
C. Chatfield. The analysis of time series: an introduction. CRC Press, 2003.
-
A. Chaturvedi, P. Green, and J. D. Carroll. K-modes clustering, Journal of Classifi-cation, 18(1), pp. 35–55, 2001.
-
N. V. Chawla, N. Japkowicz, and A. Kotcz. Editorial: Special issue on learning from imbalanced data sets. ACM SIGKDD Explorations Newsletter, 6(1), 1–6, 2004.
-
N. V. Chawla, K. W. Bower, L. O. Hall, and W. P. Kegelmeyer. SMOTE: synthetic minority over-sampling technique. Journal of Artificial Intelligence Research (JAIR), 16, pp. 321–356, 2002.
-
N. Chawla, A. Lazarevic, L. Hall, and K. Bowyer. SMOTEBoost: Improving prediction of the minority class in boosting. PKDD, pp. 107–119, 2003.
-
N. V. Chawla, D. A. Cieslak, L. O. Hall, and A. Joshi. Automatically countering imbalance and its empirical relationship to cost. Data Mining and Knowledge Discov-ery, 17(2), pp. 225–252, 2008.
-
K. Chen, and L. Liu. A survey of multiplicative perturbation for privacy-preserving data mining. Privacy-Preserving Data Mining: Models and Algorithms, Springer, pp. 157–181, 2008.
-
L. Chen, and R. Ng. On the marriage of Lp-norms and the edit distance. VLDB Conference, pp. 792–803, 2004.
-
W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. ACM KDD Conference, pp. 199–208, 2009.
Dostları ilə paylaş: |