Graduate School of Information Sciences, Tohoku University, Sendai, Japan
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
1996 ACM SIGMOD International Conference on Management of Data, 1996 – SIGMOD
We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, "Age" and "Balance" are two numeric attributes, and "CardLoan" is a ...
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996 – PODS
Given a huge database, we address the problem of finding association rules for numeric attributes, such as (Balance c 1) + (CardLoan = yes), which implies that bank customers whose balances fall in a range 1 are likely to use card loan with a ...
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
ACM SIGMOD Record, vol. 25,no. 2,1996 – SIGMOD_Record
We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, "Age" and "Balance" are two numeric attributes, and "CardLoan" is a ...
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, 1996 – VLDB
We propose an extension of an entropy-based heuristic of Quinlan [Q93] for constructing a decision tree from a large database with many numeric attributes. Quinlan pointed out that his original method (as well as other existing methods) may be ...
Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama
sixth annual symposium on Computational geometry, 1990 – SoCG
This paper considers the maximin placement of a convex polygon P inside a polygon Q, and introduce several new static and dynamic Voronoi diagrams to solve the problem. It is shown that P can be placed inside Q, using translation and rotation, so ...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuzawa, Takeshi Tokuyama, Kunikazu Yoda
VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, 1998 – VLDB
We consider the problem of finding association rules that make nearly optimal binary segmen-tations of huge categorical databases. The op-timality of segmentation is defined by an ob-jective function suitable for the users objec-tive. An objective ...
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
ACM Transactions on Database Systems, vol. 26,no. 2,2001 – TODS
We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, Age and Balance are two numeric attributes, and CardLoan is a Boolean attribute. Taking the pair ...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
Let P be a set of n points in the plane. A k-tour through P is a tour in the plane that starts and ends at the fixed origin and visits at most k points of P. Our goal is to cover all the points of P by k-tours so as to minimize the total length of ...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
Proceedings of the 3rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1997 – KDD