HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 665
#33
Bibliography
665
[SS05]
R. H. Shumway and D. S. Stoffer.
Time Series Analysis and Its Applications. New York:
Springer, 2005.
[ST96]
A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery
systems.
IEEE Trans. Knowledge and Data Engineering, 8:970–974, Dec. 1996.
[STA98]
S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with rela-
tional database systems: Alternatives and implications. In Proc. 1998 ACM-SIGMOD Int.
Conf. Management of Data (SIGMOD’98), pp. 343–354, Seattle, WA, June 1998.
[STH
+
10]
Y. Sun, J. Tang, J. Han, M. Gupta, and B. Zhao. Community evolution detection in
dynamic heterogeneous information networks. In Proc. 2010 KDD Workshop Mining
and Learning with Graphs (MLG’10), Washington, DC, July 2010.
[Ste72]
W. Stefansky. Rejecting outliers in factorial designs.
Technometrics, 14:469–479, 1972.
[Sto74]
M. Stone. Cross-validatory choice and assessment of statistical predictions.
J. Royal
Statistical Society, 36:111–147, 1974.
[SVA97]
R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints.
In Proc. 1997 Int. Conf. Knowledge Discovery and Data Mining (KDD’97), pp. 67–73,
Newport Beach, CA, Aug. 1997.
[SW49]
C. E. Shannon and W. Weaver.
The Mathematical Theory of Communication. University
of Illinois Press, 1949.
[Swe88]
J. Swets. Measuring the accuracy of diagnostic systems. Science, 240:1285–1293, 1988.
[Swi98]
R. Swiniarski. Rough sets and principal component analysis and their applications in
feature extraction and selection, data model building and classification. In S. K. Pal
and A. Skowron (eds.), Rough Fuzzy Hybridization: A New Trend in Decision-Making,
Springer Verlag, Singapore, 1999.
[SWJR07]
X. Song, M. Wu, C. Jermaine, and S. Ranka. Conditional anomaly detection.
IEEE Trans.
on Knowledge and Data Engineering, 19(5):631–645, 2007.
[SZ04]
D. Shasha and Y. Zhu.
High Performance Discovery in Time Series: Techniques and Case
Studies. New York: Springer, 2004.
[TD02]
D. M. J. Tax and R. P. W. Duin. Using two-class classifiers for multiclass classification. In
Proc. 16th Intl. Conf. Pattern Recognition (ICPR’2002), pp. 124–127, Montreal, Quebec,
Canada, 2002.
[TFPL04]
Y. Tao, C. Faloutsos, D. Papadias, and B. Liu. Prediction and indexing of moving objects
with unknown motion patterns. In Proc. 2004 ACM-SIGMOD Int. Conf. Management of
Data (SIGMOD’04), pp. 611–622, Paris, France, June 2004.
[TG01]
I. Tsoukatos and D. Gunopulos. Efficient mining of spatiotemporal patterns. In
Proc.
2001 Int. Symp. Spatial and Temporal Databases (SSTD’01), pp. 425–442, Redondo
Beach, CA, July 2001.
[THH01]
A. K. H. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. In
Proc. 2001 Int. Conf. Data Engineering (ICDE’01), pp. 359–367, Heidelberg, Germany,
Apr. 2001.
[THLN01]
A. K. H. Tung, J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-based clustering
in large databases. In Proc. 2001 Int. Conf. Database Theory (ICDT’01), pp. 405–419,
London, Jan. 2001.
[THP08]
Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summariza-
tion. In
Proc. 2008 ACM SIGMOD Int. Conf. Management of Data (SIGMOD’08),
pp. 567–580, Vancouver, British Columbia, Canada, June 2008.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 666
#34
666
Bibliography
[Thu04]
B. Thuraisingham. Data mining for counterterrorism. In H. Kargupta, A. Joshi,
K. Sivakumar, and Y. Yesha (eds.), Data Mining: Next Generation Challenges and Future
Directions, pp. 157–183. AAAI/MIT Press, 2004.
[TK08]
S. Theodoridis and K. Koutroumbas.
Pattern Recognition (4th ed.) Academic Press, 2008.
[TKS02]
P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for
association patterns. In Proc. 2002 ACM SIGKDD Int. Conf. Knowledge Discovery in
Databases (KDD’02), pp. 32–41, Edmonton, Alberta, Canada, July 2002.
[TLZN08]
L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode
networks. In Proc. 2008 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining
(KDD’08), pp. 677–685, Las Vegas, NV, Aug. 2008.
[Toi96]
H. Toivonen. Sampling large databases for association rules. In
Proc. 1996 Int. Conf. Very
Large Data Bases (VLDB’96), pp. 134–145, Bombay, India, Sept. 1996.
[TS93]
G. G. Towell and J. W. Shavlik. Extracting refined rules from knowledge-based neural
networks. Machine Learning, 13:71–101, Oct. 1993.
[TSK05]
P. N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Boston: Addison-
Wesley, 2005.
[TSS04]
A. Tanay, R. Sharan, and R. Shamir. Biclustering algorithms: A survey. In S. Aluru (ed.),
Handbook of Computational Molecular Biology, pp. 26:1–26:17. London: Chapman &
Hall, 2004.
[Tuf83]
E. R. Tufte. The Visual Display of Quantitative Information. Graphics Press, 1983.
[Tuf90]
E. R. Tufte. Envisioning Information. Graphics Press, 1990.
[Tuf97]
E. R. Tufte. Visual Explanations: Images and Quantities, Evidence and Narrative. Graphics
Press, 1997.
[Tuf01]
E. R. Tufte.
The Visual Display of Quantitative Information (2nd ed.). Graphics Press,
2001.
[TXZ06]
Y. Tao, X. Xiao, and S. Zhou. Mining distance-based outliers from large databases in any
metric space. In Proc. 2006 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases
(KDD’06), pp. 394–403, Philadelphia, PA, Aug. 2006.
[UBC97]
P. E. Utgoff, N. C. Berkman, and J. A. Clouse. Decision tree induction based on efficient
tree restructuring. Machine Learning, 29:5–44, 1997.
[UFS91]
R. Uthurusamy, U. M. Fayyad, and S. Spangler. Learning useful rules from inconclusive
data. In G. Piatetsky-Shapiro and W. J. Frawley (eds.),
Knowledge Discovery in Databases,
pp. 141–157. AAAI/MIT Press, 1991.
[Utg88]
P. E. Utgoff. An incremental ID3. In Proc. Fifth Int. Conf. Machine Learning (ICML’88),
pp. 107–120, San Mateo, CA, 1988.
[Val87]
P. Valduriez. Join indices.
ACM Trans. Database Systems, 12:218–246, 1987.
[Vap95]
V. N. Vapnik.
The Nature of Statistical Learning Theory. Springer Verlag, 1995.
[Vap98]
V. N. Vapnik.
Statistical Learning Theory. John Wiley & Sons, 1998.
[VC71]
V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative fre-
quencies of events to their probabilities. Theory of Probability and Its Applications,
16:264–280, 1971.
[VC03]
J. Vaidya and C. Clifton. Privacy-preserving
k-means clustering over vertically parti-
tioned data. In Proc. 2003 ACM SIGKDD Int. Conf. Knowledge Discovery and Data
Mining (KDD’03), Washington, DC, Aug 2003.