BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × China
1 × Spain
10 × USA
Collaborated with:
H.Tong C.Faloutsos K.Henderson B.Gallagher T.Critchlow S.Papadimitriou J.W.Shavlik L.Akoglu L.Li A.J.Chaney D.M.Blei S.Gilpin I.N.Davidson G.Abdulla B.A.Prakash Y.Sakurai M.Faloutsos K.Maruhashi S.Basu D.Koutra
Talks about:
graph (6) mine (5) larg (5) approach (3) use (3) discoveri (2) structur (2) network (2) extract (2) model (2)

Person: Tina Eliassi-Rad

DBLP DBLP: Eliassi-Rad:Tina

Facilitated 1 volumes:

KDD 2006Ed

Contributed to:

RecSys 20152015
SAC 20152015
KDD 20132013
CIKM 20122012
KDD 20122012
KDD 20112011
KDD 20102010
SAC 20092009
CIKM 20082008
KDD 20082008
KDD 20072007
SAC 20052005
KDD 20022002
ICML 20012001

Wrote 15 papers:

RecSys-2015-ChaneyBE #network #personalisation #probability #recommendation #social #using
A Probabilistic Model for Using Social Networks in Personalized Item Recommendation (AJBC, DMB, TER), pp. 43–50.
SAC-2015-HendersonGE #clustering #empirical #named #parametricity #performance #probability
EP-MEANS: an efficient nonparametric clustering of empirical probability distributions (KH, BG, TER), pp. 893–900.
KDD-2013-GilpinED #algorithm #framework #learning
Guided learning for role discovery (GLRD): framework, algorithms, and applications (SG, TER, IND), pp. 113–121.
KDD-2013-PapadimitriouE #mining #mobile #overview
Mining data from mobile devices: a survey of smart sensing and analytics (SP, TER), p. 1524.
CIKM-2012-TongPEFF #graph #scalability
Gelling, and melting, large graphs by edge manipulation (HT, BAP, TER, MF, CF), pp. 245–254.
KDD-2012-HendersonGETBAKFL #graph #mining #named #scalability
RolX: structural role extraction & mining in large graphs (KH, BG, TER, HT, SB, LA, DK, CF, LL), pp. 1231–1239.
KDD-2011-HendersonGLAETF #graph #mining #recursion #using
It’s who you know: graph mining using recursive structural features (KH, BG, LL, LA, TER, HT, CF), pp. 663–671.
KDD-2010-HendersonEFALMPT #approach #forensics #graph #metric #mining #multi
Metric forensics: a multi-level approach for mining volatile graphs (KH, TER, CF, LA, LL, KM, BAP, HT), pp. 163–172.
SAC-2009-HendersonE #graph #scalability
Applying latent dirichlet allocation to group discovery in large graphs (KH, TER), pp. 1456–1461.
CIKM-2008-TongSEF #mining #performance
Fast mining of complex time-stamped events (HT, YS, TER, CF), pp. 759–768.
KDD-2008-GallagherTEF #classification #network #using
Using ghost edges for classification in sparsely labeled networks (BG, HT, TER, CF), pp. 256–264.
KDD-2007-TongFGE #graph #pattern matching #performance #scalability
Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
SAC-2005-Eliassi-RadC #approach #hybrid #modelling #multi #scalability
A hybrid approach for multiresolution modeling of large-scale scientific data (TER, TC), pp. 511–518.
KDD-2002-Eliassi-RadCA
Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla (TER, TC, GA), pp. 488–494.
ICML-2001-Eliassi-RadS #approach #information management
A Theory-Refinement Approach to Information Extraction (TER, JWS), pp. 130–137.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.