Abstract
We survey an experiment in distinguishing voice and fax customers in a long distance telephony network based on the customers' calling patterns. We highlight three elements of algorithmic interest. First, we indicate how the theory of I/O-efficient algorithms productively guided the design of our software, whereas other algorithmic formalisms were less useful. Next, we describe a hyperplane-separator heuristic we developed for this problem whose performance here is comparable to that of an established learning algorithm. Finally, we discuss some open problems whose solution would have direct practical value.
Original language | English |
---|---|
Pages | S935-S936 |
State | Published - 1999 |
Externally published | Yes |
Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 17 Jan 1999 → 19 Jan 1999 |
Conference
Conference | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|
City | Baltimore, MD, USA |
Period | 17/01/99 → 19/01/99 |