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