all.bib

@inproceedings{park2002,
  abstract = {Fourier Domain Scoring (FDS) has been shown to give a 60\%
                  improvement in precision over the existing vector
                  space methods, but its index requires a large
                  storage space. We propose a new Web text mining
                  method using the discrete cosine transform (DCT) to
                  extract use- ful information from text documents and
                  to provide improved document ranking, without having
                  to store excessive data. While the new method
                  preserves the performance of the FDS method, it
                  gives a 40\% improve- ment in precision over the
                  established text mining methods when using only 20\%
                  of the storage space required by FDS.},
  address = {Berlin},
  author = {Laurence A.~F.~Park and Marimuthu Palaniswami and Kotagiri Ramamohanarao},
  booktitle = {The 6th European Conference on Principles of Data Mining and Knowledge Discovery},
  date-modified = {2008-06-30 15:31:15 +1000},
  doi = {10.1007/3-540-45681-3_32},
  editor = {T. Elomaa and H. Mannila and H. Toivonen},
  keywords = {signal processing; information retrieval; laurence},
  month = {August},
  number = {2431},
  pages = {385-396},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {A novel Web text mining method using the Discrete Cosine Transform},
  url = {http://www.cs.mu.oz.au/~lapark/PKDD02_Park.pdf},
  year = {2002},
  bdsk-url-1 = {%22http://www.cs.mu.oz.au/~lapark/PKDD02_Park.pdf%22},
  bdsk-url-2 = {http://www.cs.mu.oz.au/~lapark/PKDD02_Park.pdf},
  bdsk-url-3 = {http://dx.doi.org/10.1007/3-540-45681-3_32}
}
@inproceedings{park2002.2,
  abstract = {The traditional methods of spectral text retrieval
                  (FDS,CDS) create an index of spatial data and
                  convert the data to its spectral form at query
                  time. We present a new method of implementing and
                  querying an index containing spectral data which
                  will conserve the high precision performance of the
                  spectral methods, reduce the time needed to resolve
                  the query, and maintain an acceptable size for the
                  index. This is done by taking advantage of the
                  properties of the discrete cosine transform and by
                  applying ideas from vector space document ranking
                  methods.},
  address = {Los Alamitos, California, USA},
  author = {Laurence A.~F.~Park and Kotagiri Ramamohanarao and Marimuthu Palaniswami},
  booktitle = {The Second IEEE International Conference on Data Mining},
  date-modified = {2008-06-30 15:32:12 +1000},
  doi = {10.1109/ICDM.2002.1183922},
  editor = {Vipin Kumar and Shusaku Tsumoto},
  keywords = {signal processing; information retrieval; laurence},
  month = {December},
  optorganization = {IEEE Computer Society},
  pages = {346-353},
  publisher = {IEEE Computer Society},
  title = {A new implementation technique for fast Spectral based document retrieval systems},
  url = {http://www.cs.mu.oz.au/~lapark/ICDM02_Park.pdf},
  year = {2002},
  bdsk-url-1 = {http://www.cs.mu.oz.au/~lapark/ICDM02_Park.pdf},
  bdsk-url-2 = {http://dx.doi.org/10.1109/ICDM.2002.1183922}
}

This file was generated by bibtex2html 1.99.