Shinya Fushimi
Masaru Kitsuregawa
- 1.Kltsuregawa M et al "Relahonal Algebra Machme GRACE' Lecture Notes m Computer Science 147 Spnnger-Verlag pp 191-214 (1982) Google Scholar
Digital Library
- 2.Kltsuregawa IvI et al "Applzcahon of Hash to Data Base Machzne and Its Archtiecture" New GeneratIon Computing 1 Springer-Verlag pp 63-74 (1983)Google ScholarDigital Library
- 3.Kltsuregawa M and Fushlml S et al "The Urgamzahon of PlpeELne Merge Sort@" Trans of IECE Japan J66-D pp 332-339 (1983)Google Scholar
- 4.Bentley J L , " Mulhd~mensronal Bznary Search Trees Used for Assonahve Search@ CACM Vol 18 No 9, pp 509-517 (1975) Google ScholarDigital Library
- 5.Bentley J L " Mulhdzmennond Bmary Search Trees zn Database ApplzcakonY, Trans on SE Vol SE-5 No 4 pp 333-340 ( 1979)Google ScholarDigital Library
- 6.Bentley J L "Data Sb-uctures for Range Search@ Computing Surveys Vol 11 No 4 pp 397-409 (1979) Google ScholarDigital Library
- 7.Duhne-Aguayo R A " Oplzmal Desqn of a Generalzzed Ftie Urganuahon" Ph D Thesis Cornell Unlv (1977) Google ScholarDigital Library
- 8.Chang J M and Fu K S "Extended K-D Tree Database Organvalzon A Dynamo MI.&-Attnbute Clusfenng Melhod' Proc of VLDB pp 39-43 (1979)Google Scholar
- 9.Robmson,J T " The K-D-B- Tree A Search S~kcture for Large Mulhdamennonal Dynamzc IrulexeS', Proc of ACM SIGMOD Conf , pp lo-18 (1981) Google ScholarDigital Library
- 10.Ouksel,M and Scheuermann P "Multuiamasronal B-Trees Analysis of Dynamzc BehavLof' BIT 21 pp 401- 418 (1981)Google Scholar
- 11.Orensteln J A " Multulame7monal Tnes Used for Assonatave Search@ Information Processing Letters Vol 14, No 4 pp 150-157 (1981)Google Scholar
- 12.Tanaka Y "Adaphue Segmeniahon Schemes for Large Relational Database MachzneS' in Database Machines Lelllch H -0 and Mlsslkoff M ed Springer-Verlag (1983)Google Scholar
- 13.Lee D T , n Worst-Case Analyst for Regaon and Partaal Regzon Searches m Multxdzmenstonal Bmary Search Trees and Balanced Quad TreeS Acta Informatlca 9 pp 23-29 (1977)Google Scholar
- 14.Batory,D S , "On Searchang Transposed FtieS' ACM TODS Vol4 No 4 pp 531-544 (1979) Google ScholarDigital Library
- 15.Fushlml S " Multiunennonal Clustenng Technzque for Large Relakonal Database MachmeS' to appear in Proc of Internatlonal Conference on Foundations of Data Orgamzatlon, Kyoto Japan (1985)Google Scholar
- 16.Fushlml,S "Desqn of Secondary Storage System for Relatzonal Database Machme Physacal Database Organ%- zahon Method Based on Mvlhclzmensxonal Clustang and Transposdzoti, MS Thesis Umv of Tokyo (1983) (In Japanese)Google Scholar
- 17.Whang K -Y Wlederhold G and Sagalowlcz D , "Separab&ty - An Approach to Phymal Database Des@ Trans on Comuters Vol c-33 No 3 pp 209-222 (1984)Google Scholar
Index Terms
- Algorithm and performance evaluation of adaptive multidimensional clustering technique
Recommendations
Adaptive Clustering Technique Using Genetic Algorithms
This paper proposes a genetically inspired adaptive clustering algorithm for numerical and categorical data sets. To this end, unique encoding method and fitness functions are developed. The algorithm automatically discovers the actual number of ...
An efficient adaptive genetic algorithm technique to improve the neural network performance with aid of adaptive GA operators
The neural network (NN) performance improvement is one of the major topics. Thus an adaptive genetic algorithm (AGA) technique is proposed by making adaptive with respect to genetic operators like crossover and mutation. Our adaptive GA technique starts ...
Clustering problem using adaptive genetic algorithm
ICNC'05: Proceedings of the First international conference on Advances in Natural Computation - Volume Part IIIClustering is very important to data analysis and data minig. The K-Means algorithm, one of the partitional clustering approaches, is an iterative clustering technique that has been applied to many practical clustering problems successfully. However, ...
Comments