Estimating joint probabilities from marginal ones

Tao Li, Shenghuo Zhu, Mitsunori Ogihara, Yinhe Cheng

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

3 Citations (Scopus)

Abstract

Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are based on a light-weight structure, partition support. The core idea is to maintain the partition support of itemsets over logically disjoint partitions and then use it to estimate joint probabilities of itemsets of higher cardinalitiess. We present extensive mathematical analyses on both methods and compare their performances on synthetic datasets. We also demonstrate a case study of using the estimation methods in Apriori algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [9]. Experimental results show the effectiveness of the estimation methods.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages31-41
Number of pages11
Volume2454 LNCS
StatePublished - 2002
Externally publishedYes
Event4th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2002 - Aix-en-Provence, France
Duration: Sep 4 2002Sep 6 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2454 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2002
CountryFrance
CityAix-en-Provence
Period9/4/029/6/02

Fingerprint

Light weight structures
Partition
Data mining
Learning systems
Mining
Apriori Algorithm
Estimate
Data Mining
Machine Learning
Disjoint
Experimental Results
Demonstrate

Keywords

  • Association mining
  • Estimation
  • Joint probability

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Li, T., Zhu, S., Ogihara, M., & Cheng, Y. (2002). Estimating joint probabilities from marginal ones. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2454 LNCS, pp. 31-41). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2454 LNCS).

Estimating joint probabilities from marginal ones. / Li, Tao; Zhu, Shenghuo; Ogihara, Mitsunori; Cheng, Yinhe.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2454 LNCS 2002. p. 31-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2454 LNCS).

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

Li, T, Zhu, S, Ogihara, M & Cheng, Y 2002, Estimating joint probabilities from marginal ones. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 2454 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2454 LNCS, pp. 31-41, 4th International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2002, Aix-en-Provence, France, 9/4/02.
Li T, Zhu S, Ogihara M, Cheng Y. Estimating joint probabilities from marginal ones. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2454 LNCS. 2002. p. 31-41. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Li, Tao ; Zhu, Shenghuo ; Ogihara, Mitsunori ; Cheng, Yinhe. / Estimating joint probabilities from marginal ones. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2454 LNCS 2002. pp. 31-41 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{13879df853994584b113776315cd605e,
title = "Estimating joint probabilities from marginal ones",
abstract = "Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are based on a light-weight structure, partition support. The core idea is to maintain the partition support of itemsets over logically disjoint partitions and then use it to estimate joint probabilities of itemsets of higher cardinalitiess. We present extensive mathematical analyses on both methods and compare their performances on synthetic datasets. We also demonstrate a case study of using the estimation methods in Apriori algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [9]. Experimental results show the effectiveness of the estimation methods.",
keywords = "Association mining, Estimation, Joint probability",
author = "Tao Li and Shenghuo Zhu and Mitsunori Ogihara and Yinhe Cheng",
year = "2002",
language = "English (US)",
isbn = "3540441239",
volume = "2454 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "31--41",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Estimating joint probabilities from marginal ones

AU - Li, Tao

AU - Zhu, Shenghuo

AU - Ogihara, Mitsunori

AU - Cheng, Yinhe

PY - 2002

Y1 - 2002

N2 - Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are based on a light-weight structure, partition support. The core idea is to maintain the partition support of itemsets over logically disjoint partitions and then use it to estimate joint probabilities of itemsets of higher cardinalitiess. We present extensive mathematical analyses on both methods and compare their performances on synthetic datasets. We also demonstrate a case study of using the estimation methods in Apriori algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [9]. Experimental results show the effectiveness of the estimation methods.

AB - Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are based on a light-weight structure, partition support. The core idea is to maintain the partition support of itemsets over logically disjoint partitions and then use it to estimate joint probabilities of itemsets of higher cardinalitiess. We present extensive mathematical analyses on both methods and compare their performances on synthetic datasets. We also demonstrate a case study of using the estimation methods in Apriori algorithm for fast association mining. Moreover, we explore the usefulness of the estimation methods in other mining/learning tasks [9]. Experimental results show the effectiveness of the estimation methods.

KW - Association mining

KW - Estimation

KW - Joint probability

UR - http://www.scopus.com/inward/record.url?scp=79952019292&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952019292&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540441239

SN - 9783540441236

VL - 2454 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 31

EP - 41

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -