Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yizhak Idan

dblp:27/1076 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4Databases, data management, data science and information retrieval · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Data mining · 85% Machine learning and data management · 15%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.022001
Evaluation of prediction models for marketing campaigns · KDD 2001
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999
Data mining › customer relationship management
customer retention
0.012002
Customer lifetime value modeling and its use for customer retention planning · KDD 2002
Machine learning and data management
model evaluation
0.012001
Evaluation of prediction models for marketing campaigns · KDD 2001
Data mining
anomaly detection
0.011999
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999
Data mining › pattern mining
association rule mining
0.011999
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999
Data mining › anomaly detection
fraud detection
0.011999
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999
Data mining
pattern mining
0.011999
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999
Data mining › predictive modeling › classification
rule learning
0.011999
Discovery of Fraud Rules for Telecommunications - Challenges and Solutions · KDD 1999

Methods — techniques the papers use, named apart from their topics

confidence intervals · 0.0c4.5 · 0.0
YearPublicationVenuePosition
2002 Customer lifetime value modeling and its use for customer retention planning
abstract
We present and discuss the important business problem of estimating the effect of retention efforts on the Lifetime Value of a customer in the Telecommunications industry. We discuss the components of this problem, in particular customer value and length of service (or tenure) modeling, and present a novel segment-based approach, motivated by the segment-level view marketing analysts usually employ. We then describe how we build on this approach to estimate the effects of retention on Lifetime Value. Our solution has been successfully implemented in Amdocs' Business Insight (BI) platform, and we illustrate its usefulness in real-world scenarios.
Saharon Rosset, Einat Neumann, Uri Eick, Nurit Vatnik, Yizhak Idan
KDD5
2001 Evaluation of prediction models for marketing campaigns
abstract
We consider prediction-model evaluation in the context of marketing-campaign planning. In order to evaluate and compare models with specific campaign objectives in mind, we need to concentrate our attention on the appropriate evaluation-criteria. These should portray the model's ability to score accurately and to identify the relevant target population. In this paper we discuss some applicable model-evaluation and selection criteria, their relevance for campaign planning, their robustness under changing population distributions, and their employment when constructing confidence intervals. We illustrate our results with a case study based on our experience from several projects.
Saharon Rosset, Einat Neumann, Uri Eick, Nurit Vatnik, Yizhak Idan
KDD5
1999 Discovery of Fraud Rules for Telecommunications - Challenges and Solutions
abstract
Many fraud analysis systems have at their heart a rule-based engine for generating alerts about suspicious behaviors.The rules in the system are usually based on expert knowledge.Automatic rule discovery aims at using past examples of fraudulent and legitimate usage to find new patterns and rules to help distinguish between the two.Some aspects of the problem of finding rules suitable for fraud analysis make this problem unique.Among them are the following: the need to find rules combining both the properties of the customer (e.g., credit rating) and properties of the specific "behavior" which indicates fraud (e.g., number of international calls in one day); and the need for a new definition of accuracy: We need to find rules which do not necessarily classify correctly each individual "usage sample" as either fraudulent or not, but ensure the identification, with a minimum of wasted cost and effort, of most of the fraud "cases" (i.e., defrauded customers).These aspects require a special-purpose rule discovery system.We present as an example a two-stage system based on adaptation of the C4.5 rule generator, with an additional rule selection mechanism.Our experimental results indicate that this route is very promising.
Saharon Rosset, Uzi Murad, Einat Neumann, Yizhak Idan, Gadi Pinkas
KDD4
1998 A Canonical Form of Nonlinear Discrete-Time Models
abstract
Discrete-time models of complex nonlinear processes, whether physical, biological, or economical, are usually under the form of systems of coupled difference equations. In analyzing such systems, one of the first tasks is to find a state-space description of the process—that is, a set of state variables and the associated state equations. We present a methodology for finding a set of state variables and a canonical representation of a class of systems described by a set of recurrent discrete-time, time-invariant equations. In the field of neural networks, this is of special importance since the application of standard training algorithms requires the network to be in a canonical form. Several illustrative examples are presented.
Gérard Dreyfus, Yizhak Idan
Neural Comput.2