default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Luk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c29]Andrew Luk, Sandra Lien:
Effects of widely separated clusters on lotto-type competitive learning with particle swarm features. IJCNN 2009: 1931-1938- 2006
- [c28]Andrew Luk, Sandra Lien:
Lotto-Type Competitive Learning with Particle Swarm Features II. IJCNN 2006: 3640-3647 - [c27]Sin Chun Ng
, Shu Hung Leung, Andrew Luk, Yunfeng Wu:
Convergence Analysis of Generalized Back-propagation Algorithm with Modified Gradient Function. IJCNN 2006: 3672-3678 - 2005
- [c26]Sin Chun Ng, Shu-Hung Leung, Andrew Luk:
Evolution strategies on connection weights into modified gradient function for multi-layer neural networks. IJCNN 2005: 1371-1376 - [c25]Andrew Luk, Sandra Lien:
Lotto-type competitive learning with particle swarm features. IJCNN 2005: 1517-1522 - 2003
- [c24]Sin Chun Ng, Chi-Chung Cheung, Shu-hung Leung, Andrew Luk:
Fast convergence for backpropagation network with magnified gradient function. IJCNN 2003: 1903-1908 - [c23]Andrew Luk, Sandra Lien:
Detecting rare events with lotto-type competitive learning. IJCNN 2003: 2506-2511 - 2000
- [c22]Andrew Luk:
Analyses on the Generalised Lotto-Type Competitive Learning. IDEAL 2000: 9-16 - [c21]Sin Chun Ng, Shu Hung Leung, Andrew Luk:
A Weight Evolution Algorithm with Deterministic Perturbation. IJCNN (1) 2000: 185-190 - [c20]Andrew Luk, Sandra Lien:
Dynamics of the Generalized Lotto-Type Competitive Learning. IJCNN (4) 2000: 597-601
1990 – 1999
- 1999
- [j4]Sin Chun Ng, Shu Hung Leung, Andrew Luk:
Fast Convergent Generalized Back-Propagation Algorithm with Constant Learning Rate. Neural Process. Lett. 9(1): 13-23 (1999) - [c19]Sin Chun Ng, Chi Yin Chung, Shu-Hung Leung, Andrew Luk:
A variable step size algorithm using evolution strategies for adaptive filtering. CEC 1999: 542-545 - [c18]Andrew Luk, Sandra Lien:
Rival rewarded and randomly rewarded rival competitive learning. IJCNN 1999: 1325-1328 - [c17]Andrew Luk, Sandra Lien:
Lotto-type competitive learning and its stability. IJCNN 1999: 1425-1428 - [c16]Sin Chun Ng, Shu-Hung Leung, Andrew Luk:
A hybrid algorithm of weight evolution and generalized back-propagation for finding global minimum. IJCNN 1999: 4037-4042 - [c15]Sin Chun Ng, Shu Hung Leung, Andrew Luk:
The generalized back-propagation algorithm with convergence analysis. ISCAS (5) 1999: 612-615 - 1998
- [c14]Andrew Luk, Sandra Lien:
Effects of Sparsely Spaced Clusters on Lotto-Type Competitive Learning. ICONIP 1998: 229-232 - 1997
- [c13]Sin Chun Ng, S. H. Leung, Andrew Luk:
Weight evolution algorithm with dynamic offset range. ICNN 1997: 1093-1096 - [c12]Andrew Luk, Sandra Lien:
Lotto-Type Competitive Learning. ICONIP (1) 1997: 510-513 - 1996
- [j3]Sin Chun Ng, Shu-Hung Leung, Chi Yin Chung, Andrew Luk, Wing Hong Lau:
The genetic search approach. A new learning algorithm for adaptive IIR filtering. IEEE Signal Process. Mag. 13(6): 38-46 (1996) - [c11]Sin Chun Ng, Shu Hung Leung, Andrew Luk:
Evolution of Connection Weights Combined with Local Search for Multi-Layered Neural Network. International Conference on Evolutionary Computation 1996: 726-731 - [c10]Sin Chun Ng, S. H. Leung, Andrew Luk:
A generalized backpropagation algorithm for faster convergence. ICNN 1996: 409-413 - [c9]Wing Hong Lau, F. L. Hui, Shu Hung Leung, David Lee, Andrew Luk:
Audio Signal Restoration Using Higher-order Spectra. ISSPA 1996: 316-319 - 1995
- [c8]Sin Chun Ng, S. H. Leung, Andrew Luk:
Fast and Global Convergent Weight Evolution Algorithm based on Modified Back-propagation. ICNN 1995: 3004-3008 - [c7]Chi Yin Chung, Sin Chun Ng, Shu Hung Leung, Andrew Luk:
A Variable Step Size Algorithm with Generate-and Evaluate Function. ISCAS 1995: 1380-1383 - [c6]F. L. Hui, Wing Hong Lau, Shu Hung Leung, Andrew Luk:
Sequential Detection Using a New Recursive-Averaging Cumulant Estimation Method. ISCAS 1995: 2293-2296 - 1994
- [c5]Sin Chun Ng, Chi Yin Chung, Shu Hung Leung, Andrew Luk:
Fast convergent genetic search for adaptive IIR filtering. ICASSP (3) 1994: 105-108 - [c4]Andrew Luk, Wai-Fung Leung:
Optimal, matching-score network for pattern classification. ICASSP (2) 1994: 597-600 - [c3]Sin Chun Ng, Chi Yin Chung, Shu Hung Leung, Andrew Luk:
An Evolutionary Search Algorithm for Adaptive IIR Equalizer. ISCAS 1994: 53-56 - 1993
- [c2]Andrew Luk, Shu Hung Leung, Wing Hong Lau, S. L. Lee:
Prunging via number of links and neuron activities. ISCAS 1993: 2415-2418 - 1991
- [c1]Shu Hung Leung, K. L. Lai, O. Y. Wong, Andrew Luk:
A new coded excitation model using multifrequency decomposition. EUROSPEECH 1991: 245-248
1980 – 1989
- 1987
- [j2]James E. S. Macleod, Andrew Luk, D. Mike Titterington:
A Re-Examination of the Distance-Weighted k-Nearest Neighbor Classification Rule. IEEE Trans. Syst. Man Cybern. 17(4): 689-696 (1987) - 1986
- [j1]Andrew Luk, James E. S. Macleod:
An alternative nearest neighbour classification scheme. Pattern Recognit. Lett. 4(5): 375-381 (1986)
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 2025-03-04 22:34 CET 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:
