78 results on '"Fouss, François"'
Search Results
2. The Sum-over-Forests density index: identifying dense regions in a graph
3. Modularity-Driven Kernel k-means for Community Detection
4. Comparison of Graph Node Distances on Clustering Tasks
5. An optimization model for collaborative recommendation using a covariance-based regularizer
6. Algorithms and Models for Network Data and Link Analysis
7. Modularity-Driven Kernel k-means for Community Detection
8. Graph Nodes Clustering Based on the Commute-Time Kernel
9. Predictions through Lean startup? Harnessing AI-based predictions under uncertainty.
10. Optimal Tuning of Continual Online Exploration in Reinforcement Learning
11. Predictions through Lean startup? Harnessing AI-based predictions under uncertainty
12. The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
13. Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach
14. Predictions through Lean Startup? Harnessing AI-based predictions under uncertainty
15. An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
16. A Supervised Machine Learning Classification Framework for Clothing Products’ Sustainability
17. Comparison of Graph Node Distances on Clustering Tasks
18. Filter bubbles created by collaborative filtering algorithms themselves, fact or fiction? An experimental comparison
19. A Closer-to-Reality Model for Comparing Relevant Dimensions of Recommender Systems, with Application to Novelty
20. A probabilistic reputation model based on transaction ratings
21. Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
22. Filter-bubble created by collaborative filtering algorithms themselves, fact or fiction? An experimental comparison
23. Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy
24. Introduction to Recommender Systems
25. Collaborative Recommendation Systems and Link Analysis
26. Yet Another Method for Combining Classifiers Outputs: A Maximum Entropy Approach
27. Recommender systems
28. Clustering using a Sum-Over-Forests weighted kernel k-means approach
29. A link-analysis-based discriminant analysis for exploring partially labeled graphs
30. Algorithms and Models for Network Data and Link Analysis
31. A simple-cycles weighted kernel based on harmony structure for similarity retrieval
32. A novel way of computing similarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes
33. Web recommendation system based on a markov-chain model
34. Hits is PCA
35. The principal components analysis of a graph and its relationships to spectral clustering
36. A maximum entropy approach to multiple classifiers combination
37. Analyse oriente objet de processus sidérurgiques de type cokier
38. Steel production data warehouse reengineering
39. A sum-over-paths extension of edit distances accounting for all sequence alignments
40. Randomized Shortest-Path Problems: Two Related Models
41. Evaluating Performance of Recommender Systems: An Experimental Comparison
42. A Framework for QoS Driven Selection of Services
43. Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.
44. Entropy-regularized biased random walks on a graph : applications to network data analysis
45. Essays on network data analysis through the bag-of-paths framework
46. Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis
47. Les systèmes de recommandation enferment-ils les consommateurs dans une bulle ? Analyse et perspectives
48. Les causes et conséquences managériales du stress induit par le cloud - Etude des performances, du technostress et de la gestion des connaissances
49. Randomized shortest paths and their applications
50. Measures on graphs : from similarity to density
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.