default search action
Jieh-Shan Yeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
- [j4]Jieh-Shan Yeh, Po-Chiang Hsu:
HHUIF and MSICF: Novel algorithms for privacy preserving utility mining. Expert Syst. Appl. 37(7): 4779-4786 (2010) - 2009
- [j3]Chin-Chen Chang, Pei-Yu Lin
, Jieh-Shan Yeh:
Preserving robustness and removability for digital watermarks using subsampling and difference correlation. Inf. Sci. 179(13): 2283-2293 (2009) - 2008
- [j2]Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang:
Isolated items discarding strategy for discovering high utility itemsets. Data Knowl. Eng. 64(1): 198-217 (2008) - 2007
- [j1]Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang:
MICF: An effective sanitization algorithm for hiding sensitive patterns on data mining. Adv. Eng. Informatics 21(3): 269-280 (2007)
Conference and Workshop Papers
- 2013
- [c14]Che-Lun Hung, Hsiao-Hsi Wang, Jieh-Shan Yeh, Yu-Chen Hu
Preference Utility algorithm using GPGPU architecture. ICIS 2013: 155-160 - 2011
- [c13]Sheng Xiang Fan, Jieh-Shan Yeh, Yaw-Ling Lin
Hybrid Temporal Pattern Mining with Time Grain on Stock Index. ICGEC 2011: 212-215 - 2010
- [c12]Jieh-Shan Yeh, Chia-Hsien Ting:
SP&EPPF: A Novel Algorithm for Sequential Interval-based Pattern Mining. DMIN 2010: 343-349 - 2009
- [c11]Jieh-Shan Yeh, Szu-Chen Lin:
A new data structure for asynchronous periodic pattern mining. ICUIMC 2009: 426-431 - [c10]Jieh-Shan Yeh, Ying-Lin Lin, Yu-Cheng Chen:
Mining Preferred Traversal Paths with HITS. WISM 2009: 98-107 - 2008
- [c9]Jieh-Shan Yeh, Chih-Yang Chang, Yao-Te Wang:
Efficient algorithms for incremental utility mining. ICUIMC 2008: 212-217 - [c8]Jieh-Shan Yeh, Shang-Ru Yang, Chin-Chen Chang, Tzungher Chen:
Assigning Keys in a Hierarchy. IIH-MSP 2008: 1363-1366 - [c7]Jieh-Shan Yeh, Po-Chiang Hsu, Ming-Hsun Wen:
Novel Algorithms for Privacy Preserving Utility Mining. ISDA (1) 2008: 291-296 - 2007
- [c6]Jieh-Shan Yeh, Yu-Chiang Li, Chin-Chen Chang:
Two-Phase Algorithms for a Novel Utility-Frequent Mining Model. PAKDD Workshops 2007: 433-444 - 2006
- [c5]Chung-Chuan Wang, Chin-Chen Chang, Jinn-ke Jan, Jieh-Shan Yeh:
Novel Steganographic Schemes Based on Row-Major Mapping Relation. IIH-MSP 2006: 392-395 - [c4]Chin-Chen Chang, Wen-Bin Wu, Jieh-Shan Yeh:
A Cryptanalysis on a Generalized Threshold Cryptosystem. IMECS 2006: 452-455 - 2005
- [c3]Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang:
A Fast Algorithm for Mining Share-Frequent Itemsets. APWeb 2005: 417-428 - [c2]Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang:
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets. FSKD (2) 2005: 551-560 - [c1]Yuchiang Li, Chinchen Chang, Jiehshan Yeh:
An Algorithm for Mining Association Rules with Weighted Minimum Supports. AIAI 2005: 291-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-26 18:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: