default search action
Bi-Ru Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c31]Yu-Xiang Wu, Bi-Ru Dai:
STL-ConvTransformer: Series Decomposition and Convolution-Infused Transformer Architecture in Multivariate Time Series Anomaly Detection. PAKDD (1) 2024: 41-52 - 2023
- [c30]Chia-Chun Ho, Bi-Ru Dai:
Leveraging Supplementary Information for Multi-Modal Fake News Detection. ICT-DM 2023: 1-5 - 2022
- [c29]Chun-Cheng Fang, Chia-Chun Ho, Bi-Ru Dai:
A Greedy Algorithm for Budgeted Multiple-Product Profit Maximization in Social Network. MDM 2022: 440-445 - 2021
- [c28]Cheng-Han Chou, Bi-Ru Dai:
Semantic Analysis and Preference Capturing on Attentive Networks for Rating Prediction. GLOBECOM 2021: 1-6 - 2020
- [c27]Shanlei Ko, Bi-Ru Dai:
Multi-Laplacian GAN with Edge Enhancement for Face Super Resolution. ICPR 2020: 3505-3512 - [c26]Chieh-Ming Liaw, Bi-Ru Dai:
Live Stream Highlight Detection Using Chat Messages. MDM 2020: 328-332
2010 – 2019
- 2019
- [c25]Kuei-Sheng Lin, Bi-Ru Dai:
BIOG: An Effective and Efficient Algorithm for Influence Blocking Maximization in Social Networks. DMBD 2019: 328-337 - 2018
- [c24]Ye-Yan Zeng, Bi-Ru Dai:
A Multi-Label Threshold Learning Framework for Propagation Algorithms on a Non-Feature Network. GLOBECOM 2018: 1-6 - [c23]Yi Tang, Bi-Ru Dai:
A Partial Demand Fulfilling Capacity Constrained Clustering Algorithm to Static Bike Rebalancing Problem. ICDM 2018: 240-253 - 2017
- [j7]Kai-Lung Hua, Bi-Ru Dai, Kathiravan Srinivasan, You-Hsiang Hsu, Vishal Sharma:
A hybrid NSCT domain image watermarking scheme. EURASIP J. Image Video Process. 2017: 10 (2017) - [c22]Qiao Yu, Bi-Ru Dai:
Accelerating K-Means by Grouping Points Automatically. DaWaK 2017: 199-213 - [c21]Zhun-Zheng Lin, Bi-Ru Dai:
Reweighting Forest for Extreme Multi-label Classification. DaWaK 2017: 286-299 - 2016
- [c20]Mu-Yao Fang, Bi-Ru Dai:
Power of Bosom Friends, POI Recommendation by Learning Preference of Close Friends and Similar Users. DaWaK 2016: 179-192 - [c19]Sin-Kai Wang, Bi-Ru Dai:
A G-Means Update Ensemble Learning Approach for the Imbalanced Data Stream with Concept Drifts. DaWaK 2016: 255-266 - [c18]Chih-Heng Chung, Bi-Ru Dai:
A Framework of the Semi-supervised Multi-label Classification with Non-uniformly Distributed Incomplete Labels. DaWaK 2016: 267-280 - 2015
- [c17]Bing-Hao Huang, Bi-Ru Dai:
A Weighted Distance Similarity Model to Improve the Accuracy of Collaborative Recommender System. MDM (2) 2015: 104-109 - [c16]Bo-Yu Hsiao, Chih-Heng Chung, Bi-Ru Dai:
A Model of Relevant Common Author and Citation Authority Propagation for Citation Recommendation. MDM (2) 2015: 117-119 - 2014
- [j6]Chih-Heng Chung, Bi-Ru Dai:
A fragment-based iterative consensus clustering algorithm with a robust similarity. Knowl. Inf. Syst. 41(3): 591-609 (2014) - [c15]Huei-Yu Lung, Chih-Heng Chung, Bi-Ru Dai:
Predicting Locations of Mobile Users Based on Behavior Semantic Mining. PAKDD Workshops 2014: 168-180 - [c14]Chung-Kai Tseng, Chih-Heng Chung, Bi-Ru Dai:
Classifying the TRIZ Contradiction Problem of the Patents Based on Engineering Parameters. TAAI 2014: 344-353 - 2013
- [c13]Po-Wei Liang, Bi-Ru Dai:
Opinion Mining on Social Media Data. MDM (2) 2013: 91-96 - 2012
- [c12]Bi-Ru Dai, I-Chang Lin:
Efficient Map/Reduce-Based DBSCAN Algorithm with Optimized Data Partition. IEEE CLOUD 2012: 59-66 - [c11]Bi-Ru Dai, Chih-Heng Chung:
LF-CARS: A Loose Fragment-Based Consensus Clustering Algorithm with a Robust Similarity. Discovery Science 2012: 154-168 - 2011
- [j5]Yong-Huai Huang, Kuo-Liang Chung, Bi-Ru Dai:
Improved inverse halftoning using vector and texture-lookup table-based learning approach. Expert Syst. Appl. 38(12): 15573-15581 (2011) - [c10]Bi-Ru Dai, Chang-Yi Lee, Chih-Heng Chung:
A Framework of Recommendation System Based on Both Network Structure and Messages. ASONAM 2011: 709-714 - [c9]Bi-Ru Dai, Meng-Yan Lin:
Efficiently Mining Dynamic Zonal Co-location Patterns Based on Maximal Co-locations. ICDM Workshops 2011: 861-868 - [c8]Bi-Ru Dai, Shu-Ming Hsu:
An Instance Selection Algorithm Based on Reverse Nearest Neighbor. PAKDD (1) 2011: 1-12
2000 – 2009
- 2009
- [c7]Bi-Ru Dai, Pai-Yu Lin:
iTM: An Efficient Algorithm for Frequent Pattern Mining in the Incremental Database without Rescanning. IEA/AIE 2009: 757-766 - [c6]Bi-Ru Dai, Yang-Tze Lin:
A Decision Tree Based Quasi-Identifier Perturbation Technique for Preserving Privacy in Data Mining. RCIS 2009: 187-196 - 2008
- [c5]Ya-Ping Kuo, Pai-Yu Lin, Bi-Ru Dai:
Hiding Frequent Patterns under Multiple Sensitive Thresholds. DEXA 2008: 5-18 - 2007
- [j4]Jen-Wei Huang, Bi-Ru Dai, Ming-Syan Chen:
Twain: Two-end association miner with precise frequent exhibition periods. ACM Trans. Knowl. Discov. Data 1(2): 8 (2007) - [j3]Mi-Yen Yeh, Bi-Ru Dai, Ming-Syan Chen:
Clustering over Multiple Evolving Streams by Events and Correlations. IEEE Trans. Knowl. Data Eng. 19(10): 1349-1362 (2007) - [j2]Bi-Ru Dai, Cheng-Ru Lin, Ming-Syan Chen:
Constrained data clustering by depth control and progressive constraint relaxation. VLDB J. 16(2): 201-217 (2007) - [c4]Chih-Hua Tai, Bi-Ru Dai, Ming-Syan Chen:
Incremental Clustering in Geography and Optimization Spaces. PAKDD 2007: 272-283 - 2006
- [j1]Bi-Ru Dai, Jen-Wei Huang, Mi-Yen Yeh, Ming-Syan Chen:
Adaptive Clustering for Multiple Evolving Streams. IEEE Trans. Knowl. Data Eng. 18(9): 1166-1180 (2006) - [c3]Mi-Yen Yeh, Bi-Ru Dai, Ming-Syan Chen:
COMET: Event-Driven Clustering over Multiple Evolving Streams. PAKDD 2006: 719-723 - 2004
- [c2]Bi-Ru Dai, Jen-Wei Huang, Mi-Yen Yeh, Ming-Syan Chen:
Clustering on Demand for Multiple Data Streams. ICDM 2004: 367-370 - 2003
- [c1]Bi-Ru Dai, Cheng-Ru Lin, Ming-Syan Chen:
On the Techniques for Data Clustering with Numerical Constraints. SDM 2003: 264-268
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-06-03 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint