HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 669
#37
Bibliography
669
[XHLW03]
D. Xin, J. Han, X. Li, and B. W. Wah. Star-cubing: Computing iceberg cubes by top-down
and bottom-up integration. In Proc. 2003 Int. Conf. Very Large Data Bases (VLDB’03),
pp. 476–487, Berlin, Germany, Sept. 2003.
[XHSL06]
D. Xin, J. Han, Z. Shao, and H. Liu. C-cubing: Efficient computation of closed cubes by
aggregation-based checking. In Proc. 2006 Int. Conf. Data Engineering (ICDE’06), p. 4,
Atlanta, GA, Apr. 2006.
[XHYC05]
D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In
Proc.
2005 Int. Conf. Very Large Data Bases (VLDB’05), pp. 709–720, Trondheim, Norway,
Aug. 2005.
[XOJ00]
Y. Xiang, K. G. Olesen, and F. V. Jensen. Practical issues in modeling large diagnostic sys-
tems with multiply sectioned Bayesian networks.
Intl. J. Pattern Recognition and Artificial
Intelligence (IJPRAI), 14:59–71, 2000.
[XPK10]
Z. Xing, J. Pei, and E. Keogh. A brief survey on sequence classification.
SIGKDD
Explorations, 12:40–48, 2010.
[XSH
+
04]
H. Xiong, S. Shekhar, Y. Huang, V. Kumar, X. Ma, and J. S. Yoo. A framework for discov-
ering co-location patterns in data sets with extended spatial objects. In Proc. 2004 SIAM
Int. Conf. Data Mining (SDM’04), Lake Buena Vista, FL, Apr. 2004.
[XYFS07]
X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. SCAN: A structural clustering algorithm
for networks. In Proc. 2007 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases
(KDD’07), pp. 824–833, San Jose, CA, Aug. 2007.
[XZYL08]
T. Xu, Z. M. Zhang, P. S. Yu, and B. Long. Evolutionary clustering by hierarchical Dirich-
let process with hidden Markov state. In Proc. 2008 Int. Conf. Data Mining (ICDM’08),
pp. 658–667, Pisa, Italy, Dec. 2008.
[YC01]
N. Ye and Q. Chen. An anomaly detection technique based on a chi-square statistic
for detecting intrusions into information systems. Quality and Reliability Engineering
International, 17:105–112, 2001.
[YCHX05]
X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: A profile-based
approach. In Proc. 2005 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases
(KDD’05), pp. 314–323, Chicago, IL, Aug. 2005.
[YFB01]
C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent item-
sets in high dimensions. In Proc. 2001 ACM SIGKDD Int. Conf. Knowledge Discovery in
Databases (KDD’01), pp. 194–203, San Fransisco, CA, Aug. 2001.
[YFM
+
97]
K. Yoda, T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Computing optimized
rectilinear regions for association rules. In Proc. 1997 Int. Conf. Knowledge Discovery and
Data Mining (KDD’97), pp. 96–103, Newport Beach, CA, Aug. 1997.
[YH02]
X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In
Proc. 2002 Int.
Conf. Data Mining (ICDM’02), pp. 721–724, Maebashi, Japan, Dec. 2002.
[YH03a]
X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In
Proc. 2003
ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03), pp. 286–295,
Washington, DC, Aug. 2003.
[YH03b]
X. Yin and J. Han. CPAR: Classification based on predictive association rules. In Proc.
2003 SIAM Int. Conf. Data Mining (SDM’03), pp. 331–335, San Fransisco, CA, May
2003.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 670
#38
670
Bibliography
[YHA03]
X. Yan, J. Han, and R. Afshar. CloSpan: Mining closed sequential patterns in large
datasets. In Proc. 2003 SIAM Int. Conf. Data Mining (SDM’03), pp. 166–177,
San Fransisco, CA, May 2003.
[YHF10]
P. S. Yu, J. Han, and C. Faloutsos.
Link Mining: Models, Algorithms and Applications. New
York: Springer, 2010.
[YHY05]
X. Yin, J. Han, and P. S. Yu. Cross-relational clustering with user’s guidance. In Proc.
2005 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’05), pp. 344–353,
Chicago, IL, Aug. 2005.
[YHY07]
X. Yin, J. Han, and P. S. Yu. Object distinction: Distinguishing objects with identical
names by link analysis. In
Proc. 2007 Int. Conf. Data Engineering (ICDE’07), Istanbul,
Turkey, Apr. 2007.
[YHY08]
X. Yin, J. Han, and P. S. Yu. Truth discovery with multiple conflicting information
providers on the Web.
IEEE Trans. Knowledge and Data Engineering, 20:796–808, 2008.
[YHYY04]
X. Yin, J. Han, J. Yang, and P. S. Yu. CrossMine: Efficient classification across multiple
database relations. In Proc. 2004 Int. Conf. Data Engineering (ICDE’04), pp. 399–410,
Boston, MA, Mar. 2004.
[YK09]
L. Ye and E. Keogh. Time series shapelets: A new primitive for data mining. In
Proc. 2009 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’09),
pp. 947–956, Paris, France, June 2009.
[YWY07]
J. Yuan, Y. Wu, and M. Yang. Discovery of collocation patterns: From visual words to
visual phrases. In
Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR’07),
pp. 1–8, Minneapolis, MN, June 2007.
[YYH03]
H. Yu, J. Yang, and J. Han. Classifying large data sets using SVM with hierarchical clus-
ters. In
Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining
(KDD’03), pp. 306–315, Washington, DC, Aug. 2003.
[YYH05]
X. Yan, P. S. Yu, and J. Han. Graph indexing based on discriminative frequent structure
analysis. ACM Trans. Database Systems, 30:960–993, 2005.
[YZ94]
R. R. Yager and L. A. Zadeh. Fuzzy Sets, Neural Networks and Soft Computing. Van
Nostrand Reinhold, 1994.
[YZYH06]
X. Yan, F. Zhu, P. S. Yu, and J. Han. Feature-based substructure similarity search.
ACM
Trans. Database Systems, 31:1418–1453, 2006.
[Zad65]
L. A. Zadeh. Fuzzy sets.
Information and Control, 8:338–353, 1965.
[Zad83]
L. Zadeh. Commonsense knowledge representation based on fuzzy logic.
Computer,
16:61–65, 1983.
[Zak00]
M. J. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowledge and Data
Engineering, 12:372–390, 2000.
[Zak01]
M. Zaki. SPADE: An efficient algorithm for mining frequent sequences.
Machine
Learning, 40:31–60, 2001.
[ZDN97]
Y. Zhao, P. M. Deshpande, and J. F. Naughton. An array-based algorithm for simultan-
eous multidimensional aggregates. In Proc. 1997 ACM-SIGMOD Int. Conf. Management
of Data (SIGMOD’97), pp. 159–170, Tucson, AZ, May 1997.
[ZH02]
M. J. Zaki and C. J. Hsiao. CHARM: An efficient algorithm for closed itemset min-
ing. In Proc. 2002 SIAM Int. Conf. Data Mining (SDM’02), pp. 457–473, Arlington, VA,
Apr. 2002.