default search action
Edward K. F. Dang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Edward Kai Fung Dang, Robert Wing Pong Luk, Qing Li:
A Study of Word Bigrams for Pseudo-relevance Feedback in Information Retrieval. J. Univers. Comput. Sci. 30(11): 1511-1528 (2024) - 2022
- [j11]Edward Kai Fung Dang, Robert Wing Pong Luk, James Allan:
A retrieval model family based on the probability ranking principle for ad hoc retrieval. J. Assoc. Inf. Sci. Technol. 73(8): 1140-1154 (2022) - [j10]Edward Kai Fung Dang, Robert Wing Pong Luk, James Allan:
A Comparison between Term-Independence Retrieval Models for Ad Hoc Retrieval. ACM Trans. Inf. Syst. 40(3): 62:1-62:37 (2022) - 2021
- [j9]Edward Kai Fung Dang, Robert Wing Pong Luk, James Allan:
A Principled Approach Using Fuzzy Set Theory for Passage-Based Document Retrieval. IEEE Trans. Fuzzy Syst. 29(7): 1967-1977 (2021) - 2020
- [j8]Edward Kai Fung Dang, Robert Wing Pong Luk, James Allan:
Context-Dependent Feature Values in Text Categorization. Int. J. Softw. Eng. Knowl. Eng. 30(9): 1199-1219 (2020)
2010 – 2019
- 2016
- [j7]Edward Kai Fung Dang, Robert W. P. Luk, James Allan:
A context-dependent relevance model. J. Assoc. Inf. Sci. Technol. 67(3): 582-593 (2016) - 2015
- [j6]Edward Kai Fung Dang, Robert Wing Pong Luk, James Allan:
Fast-Forward Index Methods for Pseudo-Relevance Feedback Retrieval. ACM Trans. Inf. Syst. 33(4): 19:1-19:33 (2015) - 2014
- [j5]Edward K. F. Dang, Robert W. P. Luk, James Allan:
Beyond bag-of-words: Bigram-enhanced context-dependent term weights. J. Assoc. Inf. Sci. Technol. 65(6): 1134-1148 (2014) - 2010
- [j4]Edward K. F. Dang, Robert W. P. Luk, James Allan, Kei Shiu Ho, Stephen C. F. Chan, Korris Fu-Lai Chung, Dik Lun Lee:
A new context-dependent term weight computed by boost and discount using relevance information. J. Assoc. Inf. Sci. Technol. 61(12): 2514-2530 (2010)
2000 – 2009
- 2009
- [j3]Edward K. F. Dang, Robert W. P. Luk, Dik Lun Lee, Edward Kei Shiu Ho, Stephen C. F. Chan:
Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 31(11): 2083-2087 (2009) - [j2]Edward Kai Fung Dang, Ho Chung Wu, Robert Wing Pong Luk, Kam-Fai Wong:
Building a framework for the probability ranking principle by a family of expected weighted rank. ACM Trans. Inf. Syst. 27(4): 20:1-20:37 (2009) - 2008
- [j1]Edward K. F. Dang, Robert Wing Pong Luk, Lai Kuen Ho, Stephen Chi-fai Chan, Dik Lun Lee:
A new measure of clustering effectiveness: Algorithms and experimental studies. J. Assoc. Inf. Sci. Technol. 59(3): 390-406 (2008) - [c2]Ho Chung Wu, Edward K. F. Dang, Robert Wing Pong Luk, G. Ngai, Yinghao Li, James Allan, Kui-Lam Kwok, Kam-Fai Wong:
Evaluating a Novel Kind of Retrieval Models Based on Relevance Decision Making in a Relevance Feedback Environment. TREC 2008 - 2006
- [c1]Edward K. F. Dang, Robert W. P. Luk, Dik Lun Lee, Kei Shiu Ho, Stephen Chi-fai Chan:
Query-specific clustering of search results based on document-context similarity scores. CIKM 2006: 886-887
Coauthor Index
aka: Robert W. P. Luk
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 2025-01-09 13:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint