HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 659
#27
Bibliography
659
[NKNW96]
J. Neter, M. H. Kutner, C. J. Nachtsheim, and L. Wasserman.
Applied Linear Statistical
Models (4th ed.). Irwin, 1996.
[NLHP98]
R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning
optimizations of constrained associations rules. In Proc. 1998 ACM-SIGMOD Int. Conf.
Management of Data (SIGMOD’98), pp. 13–24, Seattle, WA, June 1998.
[NRS99]
A. Natsev, R. Rastogi, and K. Shim. Walrus: A similarity retrieval algorithm for image
databases. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’99),
pp. 395–406, Philadelphia, PA, June 1999.
[NW99]
J.
Nocedal
and
S.
J.
Wright.
Numerical
Optimization.
Springer
Verlag,
1999.
[OFG97]
E. Osuna, R. Freund, and F. Girosi. An improved training algorithm for support vec-
tor machines. In Proc. 1997 IEEE Workshop Neural Networks for Signal Processing
(NNSP’97), pp. 276–285, Amelia Island, FL, Sept. 1997.
[OG95]
P. O’Neil and G. Graefe. Multi-table joins through bitmapped join indices.
SIGMOD
Record, 24:8–11, Sept. 1995.
[Ols03]
J. E. Olson.
Data Quality: The Accuracy Dimension. Morgan Kaufmann, 2003.
[Omi03]
E. Omiecinski. Alternative interest measures for mining associations.
IEEE Trans.
Knowledge and Data Engineering, 15:57–69, 2003.
[OMM
+
02]
L. O’Callaghan, A. Meyerson, R. Motwani, N. Mishra, and S. Guha. Streaming-data
algorithms for high-quality clustering. In Proc. 2002 Int. Conf. Data Engineering
(ICDE’02), pp. 685–696, San Fransisco, CA, Apr. 2002.
[OQ97]
P. O’Neil and D. Quass. Improved query performance with variant indexes. In
Proc. 1997
ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’97), pp. 38–49, Tucson, AZ,
May 1997.
[ORS98]
B. ¨
Ozden, S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In
Proc. 1998 Int.
Conf. Data Engineering (ICDE’98), pp. 412–421, Orlando, FL, Feb. 1998.
[Pag89]
G. Pagallo. Learning DNF by decision trees. In
Proc. 1989 Int. Joint Conf. Artificial
Intelligence (IJCAI’89), pp. 639–644, San Francisco, CA, 1989.
[Paw91]
Z. Pawlak.
Rough Sets, Theoretical Aspects of Reasoning about Data. Kluwer Academic,
1991.
[PB00]
J. C. Pinheiro and D. M. Bates. Mixed Effects Models in S and S-PLUS. Springer Verlag,
2000.
[PBTL99]
N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets
for association rules. In Proc. 7th Int. Conf. Database Theory (ICDT’99), pp. 398–416,
Jerusalem, Israel, Jan. 1999.
[PCT
+
03]
F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. Zaki. CARPENTER: Finding closed
patterns in long biological datasets. In Proc. 2003 ACM SIGKDD Int. Conf. Knowledge
Discovery and Data Mining (KDD’03), pp. 637–642, Washington, DC, Aug. 2003.
[PCY95a]
J. S. Park, M. S. Chen, and P. S. Yu. An effective hash-based algorithm for mining associ-
ation rules. In Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’95),
pp. 175–186, San Jose, CA, May 1995.
[PCY95b]
J. S. Park, M. S. Chen, and P. S. Yu. Efficient parallel mining for association rules. In
Proc. 4th Int. Conf. Information and Knowledge Management, pp. 31–36, Baltimore, MD,
Nov. 1995.
[Pea88]
J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 660
#28
660
Bibliography
[PHL01]
J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible con-
straints. In Proc. 2001 Int. Conf. Data Engineering (ICDE’01), pp. 433–442, Heidelberg,
Germany, Apr. 2001.
[PHL
+
01]
J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang, H-Mine: Hyper-Structure Mining of
Frequent Patterns in Large Databases. In Proc. 2001 Int. Conf. Data Mining (ICDM’01),
pp. 441–448, San Jose, CA, Nov. 2001.
[PHL04]
L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: A
review. SIGKDD Explorations, 6:90–105, 2004.
[PHM00]
J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed
itemsets. In
Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge
Discovery (DMKD’00), pp. 11–20, Dallas, TX, May 2000.
[PHM-A
+
01] J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan:
Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. 2001
Int. Conf. Data Engineering (ICDE’01), pp. 215–224, Heidelberg, Germany, Apr. 2001.
[PHM-A
+
04] J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu.
Mining sequential patterns by pattern-growth: The prefixSpan approach. IEEE Trans.
Knowledge and Data Engineering, 16:1424–1440, 2004.
[PI97]
V. Poosala and Y. Ioannidis. Selectivity estimation without the attribute value
independence assumption. In Proc. 1997 Int. Conf. Very Large Data Bases (VLDB’97),
pp. 486–495, Athens, Greece, Aug. 1997.
[PKGF03]
S. Papadimitriou, H. Kitagawa, P. B. Gibbons, and C. Faloutsos. Loci: Fast outlier detec-
tion using the local correlation integral. In Proc. 2003 Int. Conf. Data Engineering
(ICDE’03), pp. 315–326, Bangalore, India, Mar. 2003.
[PKMT99]
A. Pfeffer, D. Koller, B. Milch, and K. Takusagawa. SPOOK: A system for probabilistic
object-oriented knowledge representation. In Proc. 15th Annual Conf. Uncertainty in
Artificial Intelligence (UAI’99), pp. 541–550, Stockholm, Sweden, 1999.
[PKZT01]
D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient OLAP operations in spatial
data warehouses. In Proc. 2001 Int. Symp. Spatial and Temporal Databases (SSTD’01),
pp. 443–459, Redondo Beach, CA, July 2001.
[PL07]
B. Pang and L. Lee. Opinion mining and sentiment analysis.
Foundations and Trends in
Information Retrieval, 2:1–135, 2007.
[Pla98]
J. C. Platt. Fast training of support vector machines using sequential minimal
optimization. In B. Sch¨olkopf, C. J. C. Burges, and A. Smola (eds.), Advances in Kernel
Methods—Support Vector Learning, pp. 185–208. Cambridge, MA: MIT Press, 1998.
[PP07]
A. Patcha, and J.-M. Park. An overview of anomaly detection techniques: Existing
solutions and latest technological trends. Computer Networks, 51(12):3448–3470, 2007.
[PS85]
F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer
Verlag, 1985.
[P-S91]
G. Piatetsky-Shapiro.
Notes AAAI’91 Workshop Knowledge Discovery in Databases
(KDD’91). Anaheim, CA, July 1991.
[P-SF91]
G. Piatetsky-Shapiro and W. J. Frawley.
Knowledge Discovery in Databases. AAAI/MIT
Press, 1991.
[PTCX04]
F. Pan, A. K. H. Tung, G. Cong, and X. Xu. COBBLER: Combining column and row
enumeration for closed pattern discovery. In Proc. 2004 Int. Conf. Scientific and Statistical
Database Management (SSDBM’04), pp. 21–30, Santorini Island, Greece, June 2004.