File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-540-68125-0_8
- Scopus: eid_2-s2.0-44649091207
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A decremental approach for mining frequent itemsets from uncertain data
Title | A decremental approach for mining frequent itemsets from uncertain data |
---|---|
Authors | |
Issue Date | 2008 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2008, v. 5012 LNAI, p. 64-75 How to Cite? |
Abstract | We study the problem of mining frequent itemsets from uncertain data under a probabilistic model. We consider transactions whose items are associated with existential probabilities. A decremental pruning (DP) technique, which exploits the statistical properties of items' existential probabilities, is proposed. Experimental results show that DP can achieve significant computational cost savings compared with existing approaches, such as U-Apriori and LGS-Trimming. Also, unlike LGS-Trimming, DP does not require a user-specified trimming threshold and its performance is relatively insensitive to the population of low-probability items in the dataset. © 2008 Springer-Verlag Berlin Heidelberg. |
Persistent Identifier | http://hdl.handle.net/10722/93214 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chui, CK | en_HK |
dc.contributor.author | Kao, B | en_HK |
dc.date.accessioned | 2010-09-25T14:54:21Z | - |
dc.date.available | 2010-09-25T14:54:21Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2008, v. 5012 LNAI, p. 64-75 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93214 | - |
dc.description.abstract | We study the problem of mining frequent itemsets from uncertain data under a probabilistic model. We consider transactions whose items are associated with existential probabilities. A decremental pruning (DP) technique, which exploits the statistical properties of items' existential probabilities, is proposed. Experimental results show that DP can achieve significant computational cost savings compared with existing approaches, such as U-Apriori and LGS-Trimming. Also, unlike LGS-Trimming, DP does not require a user-specified trimming threshold and its performance is relatively insensitive to the population of low-probability items in the dataset. © 2008 Springer-Verlag Berlin Heidelberg. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_HK |
dc.title | A decremental approach for mining frequent itemsets from uncertain data | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Kao, B:kao@cs.hku.hk | en_HK |
dc.identifier.authority | Kao, B=rp00123 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-540-68125-0_8 | en_HK |
dc.identifier.scopus | eid_2-s2.0-44649091207 | en_HK |
dc.identifier.hkuros | 141136 | en_HK |
dc.identifier.hkuros | 200233 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-44649091207&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 5012 LNAI | en_HK |
dc.identifier.spage | 64 | en_HK |
dc.identifier.epage | 75 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.identifier.scopusauthorid | Chui, CK=21741958100 | en_HK |
dc.identifier.scopusauthorid | Kao, B=35221592600 | en_HK |
dc.identifier.issnl | 0302-9743 | - |