default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuh Yen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j6]François Fouss
, Kevin Françoisse, Luh Yen, Alain Pirotte, Marco Saerens:
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks 31: 53-72 (2012)- 2011
- [j5]Luh Yen, Marco Saerens, François Fouss:
A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases. IEEE Trans. Knowl. Data Eng. 23(4): 481-495 (2011) - 2010
- [b1]Luh Yen:
Proximities on graphs : application to node clustering and visualization. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2010 - [j4]Amin Mantrach, Luh Yen, Jérôme Callut, Kevin Françoisse, Masashi Shimbo, Marco Saerens:
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph. IEEE Trans. Pattern Anal. Mach. Intell. 32(6): 1112-1126 (2010)
2000 – 2009
- 2009
- [j3]Luh Yen, François Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens:
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study. Data Knowl. Eng. 68(3): 338-361 (2009) - [j2]Marco Saerens, Youssef Achbany, François Fouss, Luh Yen:
Randomized Shortest-Path Problems: Two Related Models. Neural Comput. 21(8): 2363-2404 (2009) - 2008
- [j1]Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy. Neurocomputing 71(13-15): 2507-2520 (2008) - [c6]Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shimbo:
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. KDD 2008: 785-793 - 2007
- [c5]Luh Yen, François Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens:
Graph Nodes Clustering Based on the Commute-Time Kernel. PAKDD 2007: 1037-1045 - 2006
- [c4]Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
Optimal Tuning of Continual Online Exploration in Reinforcement Learning. ICANN (1) 2006: 790-800 - [c3]François Fouss, Luh Yen, Alain Pirotte, Marco Saerens:
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task. ICDM 2006: 863-868 - 2005
- [c2]Luh Yen, Denis Vanvyve, Fabien Wouters, François Fouss, Michel Verleysen, Marco Saerens:
clustering using a random walk based distance measure. ESANN 2005: 317-324 - 2004
- [c1]Marco Saerens, François Fouss, Luh Yen, Pierre Dupont:
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering. ECML 2004: 371-383
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-25 05:51 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:
