Eruditionhome - Online Resources for data mining
A comprehensive list of books on various aspects of data mining
Next: About this document
Up: No Title
Previous: Conclusions
-
M. Stonebraker, R. Agrawal et. al. DBMS Research at a crossroad: The
Vienna update. In Proc. of the 19th VLDB conference, pages 688-692,
Dublin, Ireland, 1993.
-
M.S. chen, J. Han and P.S. Yu. Data Mining: An overview from Database
perspective. IEEE Transactions on Knowledge and Data Eng., 8(6):
866-883, December 1996.
-
C.J. Alpert and A.B. Kahng. Recent Directions in Net-list
partitioning: A Survey. Integration, the VLSI Journal, 19:1-81, 1995.
-
Tian Zhang. Data Clustering For Very Large Datasets plus
Applications. PhD thesis, University of Wisconsin-Madison, 1997.
-
E. Han, G. Karypis and V. Kumar. Hypergraph Based Clustering in
High-Dimensional Data Sets: A Summary of Results.
-
C. Berge. Graphs and Hypergraphs. American Elsevier, New York, 1976.
-
G. Karypis and V. Kumar. Multilevel k way partitioning scheme for
irregular graphs. TR-95-064, Dept. Of Computer Science, University of
Minnesota, Minneapolis, 1995.
-
C.M. Fiduccia and R.M. Mattheyes. A Linear Time Heuristics for
improving Network Partitions. In Proc. ACM-IEEE Design Automation
Conf., pages 175-181, 1982.
-
S.C. Johnson. Hierarchical Clustering Schemes. Psychometrika,
32(3):241-254, 1967.
-
D. Karger. Global Min-cuts in RNC, and other ramifications of a simple
Min-cut Algorithm. In Proc. ACM-SIAM Symp. Discrete Algorithms, pages
21-30, 1993.
-
D.M. Schuler and E.G. Ulrich. Clustering and Linear Placement. In
Proc. ACM-IEEE Design Automation Conf., pages 50-56, 1972.
-
H. Shin and C. Kim. A Simple Yet Effective Technique For
Partitioning. IEEE Trans. VLSI Systems, 1(3), September 1993.
-
T.K. Ng et. al. Improvements of a Min-cut partitioning Algorithm. In
Proc. IEEE Intl. Conf. Computer Aided Design, pages 473-479, 1987.
-
L. Hagen et. al. On the intrinsic Rent Parameter and Spectra based
partitioning Methodologies. IEEE Trans. Computer Aided Design, 13(1):
27-37, 1994.
-
T. Bui et al. Improving the performance of the Kernighan-Lin and
Simulated Annealing Graph Bisection Algorithms. In Proc. of ACM-IEEE
Design Automation conf., pages 775-778, 1989.
-
T.A. Feo and M. Khellaf. A class of Bounded approximation Algorithms
for Graph Partitioning. Networks, 20:181-195, 1990.
-
W. Dai and E. Kuh. Simultaneous Floor Planning and global routing for
hierarchical building block layout. IEEE Trans. Computer Aided Design
ICs Syst, 1987.
-
K. Roy and C. Sechen. A Timing Driven N-way chip and multi-chip
partitioner. In Proc. IEEE Intl. Conf. Computer Aided Design, pages
240-247, 1993.
-
S. Hauck and G. Borriello. An evaluation of Bipartitioning
Techniques. In Proc. Chapel Hill Conf. on Adv. research in VLSI, 1995
-
P.K. Chan et. al. Spectral k-way ratio cut partitioning and
clustering. In Symp. on Integrated Systems, 1993.
-
E. Han et. al. Clustering in a High Dimensional Space using hypergraph
models. TR-97-063, Dept. Of Computer Science, University of
Minnesota, Minneapolis, 1997.
-
D. Malhotra. Two-level Clustering and Cluster Refienement
Schemes. M.S. Plan B Project Report, Dept. Of Computer Science,
University of Minneapolis, Minnesota, 1998.
Next: About this document
Up: No Title
Previous: Conclusions
Sushrut S Karanjkar
Tue Apr 21 17:00:32 CDT 1998