Databases Reference
In-Depth Information
[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.
