Agrégats de mots sémantiquement cohérents issus d'un grand graphe de terrain

Bibliographie

[Aidouni&al-2008] Assia Hamzaoui, Matthieu Latapy and Clémence Magnien, Detecting

Events in the Dynamics of Ego-centered Measurements of the Internet Topology, Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010 Proceedings of the 8th International Symposium, pages : 491-498, 2008.

[Aidouni&al-2009] Frédéric Aidouni, Matthieu Latapy and Clémence Magnien. Ten

weeks in the life of an eDonkey server, Sixth International Workshop on Hot Topics in Peer-to-Peer Systems, Parallel & Distributed Processing, IPDPS 2009. IEEE International Symposium on, pages 15, 2009.

[Albert&al-1999] R.Albert, H.Jeong, A.-L.Barabási, Diameter of the World Wide Web,

Nature Magazine, vol.401, pages : 130-131, 1999.

[Bailey&al-1986] Bailey D. A., Cuny J. E., Graph grammar based specification of

interconnexion structure for massively parallel computation, Lecture Notes in Computer Science 291 Grapg Grammars and their Application to Computer Science 3rd International Workshop, Warrenton, Virginia, USA, pages : 73-85, 1986.

[Barabas&ali-2000] A.-L. Barabasi, R. Albert, H. Jeong, and G. Bianconi, Power-Law

Distribution of the World Wide Web, Science 287 2115a, 2000.

[Barabasi&al-1999] A. Barabasi et R. Albert, Emergence of scaling in random networks,

Science 286, pages : 509-512,1999.

[Baumes&al-2005-1] Jeffrey Baumes, Mark K. Goldberg, Mukkai S. Krishnamoorthy,

Malik Magdon-Ismail, Nathan Preston : Finding communities by clustering a graph into overlapping subgraphs, IADIS AC 2005 : Algarve, Portugal , pages : 97-104, 2005.

[Baumes&al-2005-2] Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, Efficient

identification of overlapping communities, IEEE international conference on intelligence and security informatics, Atlanta GA, pages : 19-20, 2005.

194

Bibliographie

*

[Belbeze&al-2007-11Christian Belbèze and Chantal Soulé-Dupuy, Which contribution of

the Web services in the improvement of Web searching ? A behavioural study of the net surfers, International Conference on Enterprise Information Systems (ICEIS 2007), Funchal, Madeira, Portugal, , Vol. 4, INSTICC Press, pages : 129-137, 2007.

*

[Belbeze&al-2007-21Christian Belbèze, Max Chevalier and Chantal Soulé-Dupuy, Web

Services Based Information Access Architecture, IADIS International Conference WWW/Internet Freiburg Allemagne, IADIS, pages : 119-127, 2008.

*

[Belbeze&al-2007-31Christian Belbèze and Chantal Soulé-Dupuy, Apport des services Web

dans l'amélioration de l'accès¹ à l'information sur le Web ?, pages : 35-52, CORIA 2007, 2007

*

[Belbeze&al-20081Christian Belbèze and Chantal Soulé-Dupuy, Web services based

information access architecture, IADIS International Conference WWW/Internet (ICWI 2008), Freiburg, Allemagne, pages : 119-127, 13-15 october, 2008.

*

[Belbeze&al-2009-11Christian Belbèze and Matthieu Latapy, Detecting keywords used by

paedophiles, Poster, International Conference Advances in the Analysis of Online Paedophile Activity Paris, France, http://antipaedo.lip6.fr/Proceedings.pdf, 2-3 June, 2009.

*

[Belbeze&al-2009-21Christian Belbèze, David Chavalarias, Ludovic Denoyer, Raphaël

Fournier, Jean-Loup Guillaume, Matthieu Latapy, Clemence Magnien, Guillaume Valadon, Vasja Vehovar, and Ales Ziberna, Automatic Identification of Pedophile, Keywords keyword-detection, Measurement and Analysis of P2P Activity Against Paedophile, Content project, 2009. http://antipaedo.lip6.fr/T24/TR/keyword-detection.pdf

*

[Belbeze&al-2009-31Christian Belbèze, Max Chevalier, Chantal Soulé-Dupuy, Agrégats de

mots-clés validés sémantiquement Pour de nouveaux services d'accès à l'information sur Internet, Document Numérique 1279-5127, pages : 81-105 - doi :10.3166/dn.12.1.81-105, décembre 2009.

*

[Belbeze&al-2009-41Christian Belbèze, Max Chevalier, Chantal Soulé-Dupuy, Semantic

comparaison of keywords aggregates, IADIS International Conference Information Systems 2009 , pages 161-168, Barcelona, Spain, 2009.

*

[Belbeze&al-20121Christian Belbèze, Max Chevalier, Chantal Soulé-Dupuy, Evaluation

rapide du diamètre d'un graphe, EGC, pages 17-28, Bordeaux, 2012.

[Berge-19581 Claude Berge, Théorie des graphes et ses applications, Collection

universitaire de mathématiques, Dunod, Paris, 1958.

[Berge-19701 Claude Berge, Graphes et hypergraphes, Monographies Universitaires

de Mathématiques, No. 37. Dunod, Paris, 1970.

[Bollobas-19981 Bélla Bollobas, Modern Graph Theory, Graduate Text in

Mathematics, Springer 1998.

*

Publication effectuée par l'auteur dans le cadre de cette thèse

195

Bibliographie

[Botafogo&al-19911 Rodrigo A. Botafogo and Ben Shneiderman, Identifying Aggregates in

Hypertext Structures, Proceedings of the third annual ACM conference on Hypertext, San Antonio, TX, USA, pages 63-68, 1991.

[Boughamem&al-19971 M. Boughamem and C. Soulé-Dupuy, Mercure at Trec 6, In

processing of the 6^th International Conférence on Text retrieval, Trec6, NIST Gaithersburg (Maryland, USA), 1997.

[Breve&al-20101 Fabricio Breve, Liang Zhao and Marcos Quiles, Uncovering Overlap

Community Structure in Complex Networks Using Particle Competition, Artificial Intelligence and Computational Intelligence, Lecture Notes in Computer Science, Springer Berlin / Heidelberg, pages : 616-628, 2009.

[Britton&al-20081 Tom Britton, Maria Deijfen, Andreas N. Lagerås, and Mathias

Lindholm - J., Epidemics on random graphs with tunable clustering, Appl. Probab. Volume 45, Number 3, pages : 743-756, 2008.

[Buckley&al-20041 Chris Buckley and Ellen M. Voorhees, Retrieval evaluation with

incomplete information, In Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2004), pages 25-32, Sheffield, UK,. ACM Press, 2004.

[Cabazet&al-2010] Cazabet Rémy, Amblard Frédéric, Hanachi Chihab , Detection of

overlapping communities in dynamical social networks , In Proceedings of the 2010 IEEE International Conference on Social Computing ( Minneapolis - USA), (Best SIN Symposium Paper Award), 2010.

[Chen&al-20101 Wei Chen, Zhenming Liu, Xiaorui Sun and Yajun Wang, A game-

theoretic framework to identify overlapping communities in social networks, Data Mining and Knowledge Discovery archive, Volume 21 Issue 2, September 2010 , Kluwer Academic Publishers Hingham, MA, USA, DOI : 10.1007/s10618-010-0186-6, pages : 224-240, 2010.

[Cucala-20091 Lionel Cucala, Détection d'agrégats spatiaux pour données

ponctuelles, Manuscrit auteur, publié dans "41èmes Journées de Statistique, http://hal.inria.fr/docs/00/38/65/70/PDF/p16.pdf , SFdS, Bordeaux, 2009

[Dunbar-19921 Dunbar, Neocortex size as a constraint on group size in primates,

Journal of Human Evolution 22, doi :10.1016/0047-2484(92)90081-J, 1992.

[Dunbar-19981 Dunbar, Coevolution of neocortical size, group size and language in

humans, Behavioral and Brain Sciences 16 (4), R.I.M. (1993), pages : 681-735, 1993.

[Dunn-19731 J.C. Dunn, A fuzzy relative of the ISODATA process and its use in

detecting compact well-separated clusters, J. Cybernet. 3, pages 32 :57, 1973.

[Estrada&al-20101 F. J. Estrada, A. D. Jepson, and C. Chennubhotla, Spectral Embedding

and Min-Cut for Image Segmentation, British Machine Vision Conference, London, U. K., 2004.

[Faebert-20021 Richard Faebert, En réseau sur Internet, page 15, Cahiers

pédagogiques débattre en classe, pages 15, Février 2002.

[Faust-20101 Katherine Faust, A puzzle concerning triads in social networks :

Graph constraints and the triad census, Social Networks, Volume 32, Issue 3, pages : 221-233, 2010.

196

Bibliographie

[Fayaret-20111 Marc Farayet, La communication - Mieux se comprendre pour mieux

s'entendre, Edition APARIS- Edifree 93200 Saint-Denis, 2011.

[Fortunato-20101 Santo Fortunato, Community detection in graph V2, Physics Reports

486, pages : 75-174, 2010.

[Gaignon-20061 Christophe Gaignon , De la relation d'aide à la relation d'êtres, la

réciprocité transformatrice, Paris, L'Harmattan, page : 211, 2006.

[Gaume-20041 B. Gaume, Balades Aléatoires dans les Petits Mondes Lexicaux, In :

I3 Information Interaction Intelligence vol.4 - n°2 CEPADUES édition (Computer sciences), 2004.

[Gregory-20101 Steve Gregory, An Algorithm to Find Overlapping Community

Structure in Networks, PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases, Varsovie, Pologne, pages : 91 - 102, 2007.

[Hagen&al-19921 Hagen L., Kahng, A. B., New Spectral Methods for Ratio Cut

Partitioning and Clustering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 11, No. 9, pages : 1074-1085, Sept. 1992.

[Harman-19921 Harman D., Relevancefeeedback revisited, In Processing of the 15^th

Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pages : 1-10, 1992.

[Hoffman&al-19971 C. Hoffman et R. Jaon-Arinyo, Symbolic constraints in constructive

geometric constraint solving, Journal of Symbolic Compution, 23, pages :287-299, 1997.

[Hoffman&al-19991 C. Hoffman, A. Lomonosov et M. Sitharam, Planning geometric

constraint decomposition via optimal grap transformations, Actes de la conference AGTIVE '99, LNCS 1779, Spinger-Verlag, pages 309-324, 1999.

[Hoffman&al-20051 C. Hoffman, R. Joan-Arinyo. A Brief on Constraint Solving,

Computer-Aided Design and Applications, Vol. 2, No. 5, pp. 655-663, 2005.

[Jain&al-19991 A. K. Jain, M. N. Murty and P. J. Flynn, Data clustering : a review,

ACM Computing Surveys, 31(3), pages : 264-323, 1999.

[Jermann&al-20041 Jermann C., Neveu B., et Trombettoni G., Algorithmes pour la

détection de rigidités dans les CSP géométriques, Journal Électronique d'Intelligence Artificielle (JEDAI-JNPC'03), 2004.

[Jermann-20021 Jermann J., Résolution de contraintes géométriques par rigidification

récursive et propagation d'intervalles, Thèse de Doctorat, Université de Nice Sophia-Antipolis, pages : 104 ; 121-160, 2002.

[Kernigha&al-19701 B. W. Kernighan and S. Lin. An efficient heuristic procedure for

partitioning graphs, Bell System Technical Journal, 49(2), pages : 29-308, 1970.

[Latapy-20071 Matthieu Latapy, Habilitation à diriger les recherches, Université

Pierre et Marie CURIE, 2007.

[Latouche&al-20101 Pierre Latouche, Etienne Birmelé et Christophe Ambroise,

Overlapping Stochastic Block Models with Application to the French Political Blogosphere, Annals of Applied Statistics, 2010.

197

Bibliographie

[Leskovec&al-20051 Jurij Leskovec, Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg

and Christos Faloutsos Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication, ECML/PKDD 2005, Porto, Portugal, 2005.

[Magnien-20091 Magnien C., M. Latapy, M. Habib : Fast Computation of Empirically

Tight Bounds for the Diameter of Massive Graphs, ACM Journal of Experimental Algorithmics, 13, 10 :1.10-10 :1.9., 2009

[Mashaghi&al-20041 A. R. Mahaghi, A. Ramezapour, V. Karimipour, Investigation of a

protein complex network, The European physical journal B, Condensed matter physics ISSN 14346028 , vol. 41, no1, pages : 113-121, 2004.

[Meirieu-19961 Philippe Meirieu, Outils pour apprendre en groupe, Sixième édition,

pages 36-37, Chronique Sociale, 1996.

[MikaVrije-20051 Peter MikaVrije , Ontologies are us : A unified model of social

networks and semantics, 4th International Semantic Web Conference, ISWC 2005, Galway, Ireland, pages : 522-536, 2005.

[Millgram&al-19691 Stanley Milgram and Travers, Jeffrey, An Experimental Study of the

Small World Problem, Sociometry, Vol. 32, No. 4, pages : 425-443, 1969.

[Navarro&al-20101 Navarro Emmanuel, Cazabet Rémy, Détection de communautés, étude

comparative sur graphes réels, Marami10, Toulouse, 2010.

[Newman&al-2004-11 M. E. J. Newman and M. Girvan. Finding and evaluating community

structure in networks, Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 69(2) :026113, 2004.

[Newman&al-2004-31 M. E. J. Newman and M. Girvan, Finding and evaluating community

structure in networks, Physical Review E, 69(2) :026113, vol. 70, 2004.

[Newman&al-20081 M. E. J. Newman and E. A. Leicht , Community structure in directed

networks, Phys. Rev. Lett. 100, 118703, 2008.

[Newman-2004-21 M. E. J. Newman, Fast algorithm for detecting community in

networks. Phys. Rev. E 69, 066133, 2004.

[Newman-20061 M. E. J. Newman, Modularity and community structure in networks,

Proceedings of the National Academy of Sciences, 103(23) :8577-8582, Published online 2006 May 24. doi : 10.1073/pnas.0601602103, PMCID : PMC1482622, 2006.

[Nicosia&al-20091 V Nicosia, G Mangioni, V Carchiolo and M Malgeri2, Extending the

definition of modularity to directed graphs with overlapping communities, Journal of Statistical Mechanics : Theory and Experiment, Vol. 2009, No. 03. (01 March 2009), P03024, 2009.

[Padrol-Sureda&al-20101 Arnau Padrol-Sureda, Guillem Perarnau-Llobet, Julian Pfeifle and

Victor Muntes-Mulero, Overlapping Community Search for social networks, icde, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pages : 992-995, 2010.

[Page&al-19981 Lawrence Page, Sergey Brin, Rajeev Motwani, Terry WinogradL, The

pagerank citation ranking : Bringing order to the web. Stanford Digital Libraries Working, Stanford Digital Libraries SIDL-WP-1999-0120, 1998.

198

Bibliographie

[Palla&al-20051 Gergely Palla, Imre Derenyi, Illes Farkas, and Tamas Vicsek,

Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435, pages : 814-818, 2005.

[Palla&al-20071 G. Palla, I. J. Farkas, P. Pollner, I. Derényi and T. Vicsek, Directed

network modules, New Journal of Physics, doi :10.1088/1367-2630/9/6/186, 9, 186, 2007.

[Pastor-Satorras&al-20011 R. Pastor-Satorras and A. Vespignani. Epidemic spreading in scale-free networks. Physical Review Letters 86 (14), pages : 3200-3203. arXiv :cond-mat/0010317. Bibcode 2001PhRvL..86.3200P. doi :10.1103/PhysRevLett.86.3200. PMID 11290142, 2001

[Piaget-19691 Jean Piaget, Psychologie et pédagogie, Paris : Denoël, 1969.

[Pons&al-20051 Pascal Pons and Matthieu Latapy, Computing communities in large

networks using random walks, In Proceedings of the 20th International Symposium on Computer and Information Sciences (ISCIS'05), volume 3733 of Lecture Notes in Computer Science, Springer, pages : 284-293, Istanbul, Turkey, 2005.

[Pons-20071 Pascal Pons, Détection de communautés dans les grands graphes de

terrain, Thèse, Université Paris 7 Denis Diderot ufr d'informatique, 2007.

[Radicchi&al-20041 Filippo Radicchi, Claudio Castellano, Federico Cecconi, Vittorio

Loreto, and Domenico Parisi, Defining and identifying communities in networks, PNAS, 101(9) : pages : 2658-2663, 2004.

[Rao&al-20101 Francesco Rao, Sean Garrett-Roe, and Peter Hamm, Structural

Inhomogeneity of Water by Complex Network Analysis, J. Phys. Chem. B, 114 (47), 2010.

[Rossia&al-20101 Fabrice Rossia and Nathalie Villa-Vialaneix, Optimizing an

Organized Modularity Measure for Topographic Graph Clustering : a Deterministic Annealing Approach, Neurocomputing, Volume 73, Issues 7-9, Pages : 1142-1163, Mars 2010.

[Salton&al-19831 Gerard Salton, M.J. McGill, Introduction to modern information

retrieval, isdn : 0070544840, McGraw-Hill, 1983.

[Schaffer-20071 Schaeffer E. S., Graph clustering, Computer Science Review, 1(1),

pages : 27-64, 2007.

[Scott-20001 J. Scott, Social network analysis, a handbook. Deuxième edition,

Edition Sage, 2000.

[Shang&al-20071 Shang, Chen et Zhou, Detecting Overlapping Communities Based on

Community Cores in ComplexNetworks, CHIN. PHYS. LETT. Vol. 27, No. 5, 058901, 2010.

[Sparck&al-19971 Karen Sparck Jones and Peter Willet, Readings in Information

Retrieval, San Francisco : Morgan Kaufmann, ISBN 1-55860-454-4, 1997.

[Vei&al-20101 Fang Wei, Weining Qian, Zhongchao Fei and Aoying Zhou,

Identifying Community Structures in Networks with Seed Expansion, DASFAA (1) 2010, pages : 627634, 2010.

[Villa&al-20091 Villa N. and Rossi F. , Méthode de classification organisée pour la

recherche de communautés dans les réseaux sociaux, In Actes des 41èmes Journées de Statistique, SFdS, Journée satellite STID (conférence invitée), Bordeaux, France. Mai 2009.

199

Bibliographie

[Vygotsky-19321 Lev Vygotsky : Pensée et langage, Gosizdat, Moscow, Chapitre 2,

1932. http://www.marxists.org/archive/vygotsky/works/words/ch02.htm

[Ward-19631 J. H. Ward. Hierarchical grouping to optimize an objective function,

Journal of the American Statistical Association, 58(301), pages : 236-244, 1963.

[Watts-19991 Watts D., Networks, Dynamics, and the Small-World Phenomenon,

American Journal of Sociology, Vol. 105, No. 2, September 1999.

[Watts&al-19981 Watts D.J., Strogatz S.H., Collective dynamics of

`smallworld'networks, Nature, 393, pages : 440-442, 1998.

[Weber&al-20011 Weber A.E., Roy E., Blais L. et coll., HIV risk and prostitution among

females in the Montréal Street Youth Cohort, Journal canadien des maladies infectieuses, , 12 (Suppl B) : 67B, 2001.

[Zadeh-19651 Zadeh, L. A. Fuzzy sets, Information and Control, Vol. 8, pages : 338-

353, 1965.

[Zhang&al-20071 S Zhang, RS Wang, XS Zhang, Uncovering fuzzy community structure

in complex networks, Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Oct ;76(4 Pt 2) :046103. Epub, 2007.

[Zhanga&al-20071 Shihua Zhanga, Rui-Sheng Wangb and Xiang-Sun Zhanga,

Identification of overlapping community structure in complex networks using fuzzy c-means clustering, Physica A : Statistical Mechanics and its Applications, Volume 374, Issue 1, 15 January 2007, pages : 483-490, 2007.

[Zipf-19351 Zipf G. K., The Psychobiology of Language, an Introduction to

Dynamic Philology, Boston, Houghton-Mifflin, 1935.

[Zittoum-19971 Tania Zittou : Conflit de points de vue socialement expérimenté et

cognitivement résolu. Cahiers de Psychologie 33, pages : 27-30, 1997.

200

Index