Sciweavers

497 search results - page 25 / 100
» Mining for Profitable Customers
Sort
View
CEC
2010
IEEE
14 years 7 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
CIKM
2008
Springer
14 years 11 months ago
Identification of class specific discourse patterns
In this paper we address the problem of extracting important (and unimportant) discourse patterns from call center conversations. Call centers provide dialog based calling-in supp...
Anup Chalamalla, Sumit Negi, L. Venkata Subramania...
KBS
2007
75views more  KBS 2007»
14 years 9 months ago
Managing restaurant tables using constraints
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
77
Voted
CSIE
2009
IEEE
15 years 4 months ago
An Enhanced-Security Fair E-payment Protocol
Customers are usually passive in an electronic commerce transaction. Based on a new two times concurrent signature, this article presents a fair electronic payment (E-payment) pro...
Wei Fan, Huaying Shu, Elizabeth Fife, Qiang Yan