Остановите войну!
for scientists:
default search action
Byeong-Soo Jeong
- > Home > Persons > Byeong-Soo Jeong
Publications
- 2016
- [c49]Batjargal Dolgorsuren, Weihua Xu, Kifayat-Ullah Khan, Byeong-Soo Jeong, Young-Koo Lee:
SP2: spanner construction for shortest path computation on streaming graph. EDB 2016: 43-50 - [c48]Van T. T. Duong, Kifayat-Ullah Khan, Byeong-Soo Jeong, Young-Koo Lee:
Top-k frequent induced subgraph mining using sampling. EDB 2016: 110-113 - [c47]Jawad Khan, Byeong-Soo Jeong, Young-Koo Lee, Aftab Alam:
Sentiment analysis at sentence level for heterogeneous datasets. EDB 2016: 159-163 - 2014
- [c42]Jihye Hong, Hyunwook Kim, Waqas Nawaz, Kisung Park, Byeong-Soo Jeong, Young-Koo Lee:
Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs. DASFAA Workshops 2014: 75-88 - 2012
- [j14]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee, Ho-Jin Choi:
Single-pass incremental and interactive mining for weighted frequent patterns. Expert Syst. Appl. 39(9): 7976-7994 (2012) - 2011
- [j12]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl. Intell. 34(2): 181-198 (2011) - 2009
- [j9]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
An Efficient Algorithm for Sliding Window-Based Weighted Frequent Pattern Mining over Data Streams. IEICE Trans. Inf. Syst. 92-D(7): 1369-1381 (2009) - [j8]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Efficient single-pass frequent pattern mining using a prefix-tree. Inf. Sci. 179(5): 559-583 (2009) - [j7]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Sliding window-based frequent pattern mining over data streams. Inf. Sci. 179(22): 3843-3865 (2009) - [j6]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases. IEEE Trans. Knowl. Data Eng. 21(12): 1708-1721 (2009) - [c27]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining high utility patterns in incremental databases. ICUIMC 2009: 656-663 - [c26]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Discovering Periodic-Frequent Patterns in Transactional Databases. PAKDD 2009: 242-253 - [c25]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
An Efficient Candidate Pruning Technique for High Utility Pattern Mining. PAKDD 2009: 749-756 - 2008
- [j5]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Mining Regular Patterns in Transactional Databases. IEICE Trans. Inf. Syst. 91-D(11): 2568-2577 (2008) - [j4]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Handling Dynamic Weights in Weighted Frequent Pattern Mining. IEICE Trans. Inf. Syst. 91-D(11): 2578-2588 (2008) - [c24]Pham Thi Thu Thuy, Young-Koo Lee, Sungyoung Lee, Byeong-Soo Jeong:
Exploiting XML Schema for Interpreting XML Documents as RDF. IEEE SCC (2) 2008: 555-558 - [c23]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Efficient Single-Pass Mining of Weighted Interesting Patterns. Australasian Conference on Artificial Intelligence 2008: 404-415 - [c22]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns. AusDM 2008: 79-86 - [c21]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
Efficient frequent pattern mining over data streams. CIKM 2008: 1447-1448 - [c20]M. Rezwanul Huq, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee:
Towards Building File Sharing and Adaptation Service for Advanced Collaborating Environment. ICOIN 2008: 1-5 - [c19]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database. IDEAL 2008: 193-200 - [c18]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns Using Adaptive Weights. IDEAL 2008: 258-265 - [c17]Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong, Young-Koo Lee:
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining. PAKDD 2008: 1022-1027 - [c16]Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer, Byeong-Soo Jeong, Young-Koo Lee:
Mining Weighted Frequent Patterns in Incremental Databases. PRICAI 2008: 933-938 - 2007
- [c15]Min Meng, Xiaoling Wu, Byeong-Soo Jeong, Sungyoung Lee, Young-Koo Lee:
Energy Efficient Routing in Multiple Sink Sensor Networks. ICCSA Workshops 2007: 561-566 - [c12]Tuyen Nguyen, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee:
Event Query Processing in EPC Information Services. SITIS 2007: 159-166 - [c11]Mohammad Rezwanul Huq, Nguyen Thi Thanh Tuyen, Young-Koo Lee, Byeong-Soo Jeong, Sungyoung Lee:
Modeling an Ontology for Managing Contexts in Smart Meeting Space. SWWS 2007: 96-102 - 2006
- [c9]Byeong-Soo Jeong, Young-Koo Lee:
Storing and Querying of XML Documents Without Redundant Path Information. ICCSA (2) 2006: 505-514
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-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint