Interval finding and its application to data mining

Takeshi Fukuda, Yasuhiko Morimoto, Shinich Morishita, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


In this paper, we investigate inverse problems of the interval query problem in application to data mining. Let I be the set of all intervals on U={0, 1, 2,.., n}. Consider an objective function f(I), conditional functions ui(I) on I, and define an optimization problem of finding the interval I maximizing f(I) subject to ui(I) > Ki for given real numbers Ki (i=1, 2,.., h). We propose efficient algorithms to solve the above optimization problem if the objective function is either additive or quotient, and the conditional functions are additive, where a function f is additive f(I) = Σi I f(i) extending a function f on U, and quotient if it is represented as a quotient of two additive functions. We use computational-geometric methods such as convex hull, range searching, and multidimensional divide-and-conquer.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings
EditorsHiroshi Nagamochi, Satoru Miyano, Tetsuo Asano, Yoshihide Igarashi, Subhash Suri
Number of pages10
ISBN (Print)3540620486, 9783540620488
Publication statusPublished - 1996 Jan 1
Event7th International Symposium on Algorithms and Computation, ISAAC 1996 - Osaka, Japan
Duration: 1996 Dec 161996 Dec 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other7th International Symposium on Algorithms and Computation, ISAAC 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Interval finding and its application to data mining'. Together they form a unique fingerprint.

Cite this