新規登録 | ログイン | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

xiaoyan2006 thesis [53 articles]

最近 xiaoyan2006 さんのライブラリに追加された論文の中から タグ thesis. You can also see everyone's thesis.
  • Using unsupervised link discovery methods to find interesting facts and connections in a bibliography dataset
    SIGKDD Explor. Newsl., Vol. 5, No. 2. (December 2003), pp. 173-178.
    by Shou-De Lin, Hans Chalupsky
    posted to evaluation thesis by xiaoyan2006 on 2008-08-17 23:14:46 as ** along with 1 person ldietz
  • Graph mining: Laws, generators, and algorithms
    ACM Comput. Surv., Vol. 38, No. 1. (2006)
    by Deepayan Chakrabarti, Christos Faloutsos
    posted to graph-theory thesis by xiaoyan2006 on 2008-04-23 19:32:45 as ** along with 2 people sugarexpletive yori
  • Fast Random Walk with Restart and Its Applications
    (2006), pp. 613-622.
    by Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
    posted to random-work thesis by xiaoyan2006 on 2008-04-14 19:22:53 as ** along with 3 people and 1 group mpotamias ChaTo michaelmampaey ADMiRes
  • Using Self-Similarity to Cluster Large Data Sets
    Data Mining and Knowledge Discovery, Vol. 7, No. 2. (1 April 2003), pp. 123-152.
    by Daniel Barbará, Ping Chen
    posted to clustering thesis by xiaoyan2006 on 2008-03-27 15:24:25 as ** along with 3 people saia koles beete
  • Algorithms for Storytelling
    IEEE Transactions on Knowledge and Data Engineering (2008)
    by Deept Kumar, Naren Ramakrishnan, Richard F Helm, Malcolm Potts
    posted to ssp thesis by xiaoyan2006 on 2008-03-23 19:50:18 as **
  • Computational experiments with a lazy version of a  K  quickest simple path ranking algorithm
    TOP, Vol. 15, No. 2. (11 December 2007), pp. 372-382.
    by M Pascoal, M Captivo, J Clímaco
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-25 20:09:45 as **
  • An algorithm for ranking quickest simple paths
    Comput. Oper. Res., Vol. 32, No. 3. (March 2005), pp. 509-520.
    by Marta MB Pascoal, Eugénia, Ao C Jo\
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-25 20:00:28 as **
  • On the difficulty of some shortest path problems
    ACM Trans. Algorithms, Vol. 3, No. 1. (February 2007)
    by John Hershberger, Subhash Suri, Amit Bhosle
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-15 21:21:34 as **
  • TUBE (Text-cUBE) for discovering documentary evidence of associations among entities
    (2007), pp. 824-828.
    by Hady W Lauw, Ee-Peng Lim, Hweehwa Pang
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 17:40:48 as ** along with 1 person AlisonBabeu
  • Fast discovery of connection subgraphs
    (2004), pp. 118-127.
    by Christos Faloutsos, Kevin S Mccurley, Andrew Tomkins
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 17:33:56 as ** along with 11 people and 3 groups jrw mhay zqshen ldietz fsilvestri bigbossman Repton sakaradam nicolasj daniel51 mamader kdl GraphVis InformationRetrieval
  • Unapparent information revelation: a concept chain graph approach
    (2005), pp. 329-330.
    by Rohini K Srihari, Sudarshan Lamkhede, Anmol Bhasin
    posted to application graph-theory hmm thesis by xiaoyan2006 on 2008-02-04 17:18:27 as **
  • GMine: a system for scalable, interactive graph visualization and mining
    (2006), pp. 1195-1198.
    by Jos&\#233; F Rodrigues, Hanghang Tong, Agma JM Traina, Christos Faloutsos, Jure Leskovec
    posted to exploring graph-theory thesis by xiaoyan2006 on 2008-02-04 17:07:14 as ** along with 4 people and 1 group wnpx ianturton bigbossman markymaypo ARTFL
  • Center-piece subgraphs: problem definition and fast solutions
    (2006), pp. 404-413.
    by Hanghang Tong, Christos Faloutsos
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 16:41:08 as ** along with 3 people and 2 groups azygmunt michaelmampaey uwenagel AGH-IISG ADMiRes
  • The Most Reliable Subgraph Problem
    Knowledge Discovery in Databases: PKDD 2007 (2007), pp. 471-478.
    by Petteri Hintsanen
    posted to graph-theory thesis by xiaoyan2006 on 2008-02-04 16:38:33 as **
  • Discovering informative connection subgraphs in multi-relational graphs
    SIGKDD Explor. Newsl., Vol. 7, No. 2. (December 2005), pp. 56-63.
    by Cartic Ramakrishnan, William H Milnor, Matthew Perry, Amit P Sheth
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 20:59:47 as ** along with 5 people bigbossman graphminer fwkroon uwenagel pablomendes
  • Knowledge discovery of multiple-topic document using parametric mixture model with dirichlet prior
    (2007), pp. 590-598.
    by Issei Sato, Hiroshi Nakagawa
    posted to multiple-topics thesis by xiaoyan2006 on 2008-01-29 17:19:54 as **
  • Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
    (2007), pp. 619-628.
    by Benyah Shaparenko, Thorsten Joachims
    posted to language-model thesis by xiaoyan2006 on 2008-01-29 17:06:45 as ** along with 1 person ldietz
  • Fast best-effort pattern matching in large attributed graphs
    (2007), pp. 737-746.
    by Hanghang Tong, Christos Faloutsos, Brian Gallagher, Tina Eliassi-Rad
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 16:53:10 as **
  • Measuring and extracting proximity in networks
    (2006), pp. 245-255.
    by Yehuda Koren, Stephen C North, Chris Volinsky
    posted to graph-theory thesis by xiaoyan2006 on 2008-01-29 15:25:05 as ** along with 2 people balicea RafG
  • Ranking Complex Relationships on the Semantic Web
    IEEE Internet Computing, Vol. 9, No. 3. (May 2005), pp. 37-44.
    by Boanerges Aleman-Meza, Christian Halaschek-Wiener, Budak I Arpinar, Cartic Ramakrishnan, Amit P Sheth
    posted to semantic-web thesis by xiaoyan2006 on 2007-11-05 15:24:53 as read along with 1 person and 1 group dvallet NETS-UAM
  • Lexical Semantic Relatedness with Random Graph Walks
    (June 2007)
    by Thad Hughes, Daniel Ramage
    posted to sim thesis by xiaoyan2006 on 2007-10-30 21:19:34 as **
  • A Survey on PageRank Computing
    Internet Mathematics, Vol. 2, No. 1. (2005), pp. 73-120.
    by Pavel Berkhin
    posted to pagerank thesis by xiaoyan2006 on 2007-10-30 21:03:04 as **
  • Explanation in Recommender Systems
    Artificial Intelligence Review, Vol. 24, No. 2. (October 2005), pp. 179-197.
    by David Mcsherry
    posted to explanation thesis by xiaoyan2006 on 2007-10-24 19:42:20 as read along with 5 people bj beatty astewart suleehs brianlimyl
  • A Survey of Explanations in Recommender Systems
    (2007)
    by N Tintarev, J Masthoff
    posted to explanation thesis by xiaoyan2006 on 2007-10-22 18:02:53 as read
  • Explaining Recommendations
    User Modeling 2007 (2007), pp. 470-474.
    by Nava Tintarev
    posted to explanation thesis by xiaoyan2006 on 2007-10-22 17:58:39 as read along with 1 person suleehs
  • Trust-inspiring explanation interfaces for recommender systems
    Know.-Based Syst., Vol. 20, No. 6. (August 2007), pp. 542-556.
    by Pearl Pu, Li Chen
    posted to explanation interface thesis by xiaoyan2006 on 2007-10-17 20:47:41 as ***** along with 2 people suleehs Jon_Loewe
  • Reasoning about sets using redescription mining
    (2005), pp. 364-373.
    by Mohammed J Zaki, Naren Ramakrishnan
    posted to algorithm thesis by xiaoyan2006 on 2007-08-29 16:38:41 as read along with 2 people and 2 groups bigbossman michaelmampaey VT_DLRL ADMiRes
  • Literature-based discovery on the World Wide Web
    ACM Trans. Inter. Tech., Vol. 2, No. 4. (November 2002), pp. 261-275.
    by Michael Gordon, Robert K Lindsay, Weiguo Fan
    posted to thesis by xiaoyan2006 on 2007-08-24 02:25:45 as ** along with 1 person and 1 group akastrin VT_DLRL
  • Extending the boolean and vector space models of information retrieval with p-norm queries and multiple concept types
    (1983)
    by Edward A Fox
    posted to thesis by xiaoyan2006 on 2007-08-23 20:16:40 as ** along with 1 person and 1 group godmar VT_DLRL
  • Exploring digital libraries: integrating browsing, searching, and visualization
    (2006), pp. 1-10.
    by Rao Shen, Naga S Vemuri, Weiguo Fan, Ricardo, Edward A Fox
    posted to exploring thesis by xiaoyan2006 on 2007-06-01 20:15:30 as ** along with 1 group VT_DLRL
  • Optimizing web search using social annotations
    (2007), pp. 501-510.
    by Shenghua Bao, Guirong Xue, Xiaoyuan Wu, Yong Yu, Ben Fei, Zhong Su
    posted to algorithm thesis by xiaoyan2006 on 2007-06-01 19:07:19 as read along with 20 people and 5 groups agulli tolosoft dartar dullhunk fabianabel brusilovsky rosta_farzan OriginalLurch alad gionis suleehs sharon_hsiao qili intrect mj23 echi ChaTo macle krisl donade CMU-HCII VT_DLRL social_navigation Adaptive-Web Social Web
  • Academic Social Referencing tools: a user trial with BibSonomy and Cite-U-Like organized by the Library of the University of Amsterdam
    (May 2007)
    by HJ Heesakkers, M Hoekstra, Maurits van der Graaf
    posted to survey thesis by xiaoyan2006 on 2007-05-21 17:52:05 as read along with 2 people and 1 group amarois JSicot VT_DLRL
  • Supporting exploratory search
    Communications of the ACM, Vol. 49, No. 4. (April 2006)
    edited by Ryen W White, Bill Kules, Steven M Drucker, MC Schraefel
    posted to sspw thesis by xiaoyan2006 on 2007-04-14 20:40:56 as read along with 1 group VT_DLRL
  • Hard queries can be addressed with query splitting plus stepping stones and pathways
    IEEE Data Engineering Bulletin, Vol. 28, No. 4. (2005), pp. 29-38.
    by Xiaoyan Yu, Fernando, Edward A Fox
    posted to ssp thesis by xiaoyan2006 on 2007-04-14 20:05:11 as read along with 1 group VT_DLRL
  • Connecting topics in document collections with stepping stones and pathways
    (2005), pp. 91-98.
    by Fernando Das-Neves, Edward A Fox, Xiaoyan Yu
    posted to sspw thesis by xiaoyan2006 on 2007-04-13 20:19:02 as read along with 2 people and 2 groups lillejul umurthy21 VT_DLRL L3S
  • Turning CARTwheels: an alternating algorithm for mining redescriptions
    (2004), pp. 266-275.
    by Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malcolm Potts, Richard F Helm
    posted to sspw thesis by xiaoyan2006 on 2007-04-13 20:06:39 as read along with 1 group VT_DLRL
  • Information discovery from complementary literatures: categorizing viruses as potential weapons
    J. Am. Soc. Inf. Sci. Technol., Vol. 52, No. 10. (August 2001), pp. 797-812.
    by Don R Swanson, Neil R Smalheiser, A Bookstein
    posted to sspw thesis by xiaoyan2006 on 2007-04-13 20:03:36 as read along with 1 person and 1 group bigbossman VT_DLRL
  • Mining Novellas from PubMed Abstracts using a Storytelling Algorithm
    (2007)
    by Joseph Gresock, Deept Kumar, Richard F Helm, Malcolm Potts, Naren Ramakrishnan
    posted to sspw thesis by xiaoyan2006 on 2007-04-13 17:35:20 as read along with 1 group VT_DLRL
  • Context-Aware Semantic Association Ranking
    (September 2003), pp. 33-50.
    by Boanerges Aleman-Meza, Chris Halaschek, Budak I Arpinar, Amit Sheth
    posted to rank relationship thesis by xiaoyan2006 on 2007-04-11 15:40:19 as read along with 1 group VT_DLRL
  • Searching and Ranking Documents based on Semantic Relationships
    (2006)
    by Boanerges Aleman-Meza
    posted to rank relationship thesis by xiaoyan2006 on 2007-04-11 15:17:49 as read along with 1 group VT_DLRL
  • SemRank: ranking complex relationship search results on the semantic web
    (2005), pp. 117-127.
    by Kemafor Anyanwu, Angela Maduko, Amit Sheth
    posted to rank relationship thesis by xiaoyan2006 on 2007-04-05 22:49:21 as read along with 1 group VT_DLRL
  • A* search: Minimizing the total estimated solution cost
    (2003), pp. 94-107.
    by Stuart Russell, Peter Norvig
    posted to algorithm thesis by xiaoyan2006 on 2007-04-04 21:37:55 as ** along with 1 group VT_DLRL
  • Greedy best-first search
    (2003), pp. 94-95.
    by Stuart Russell, Peter Norvig
    posted to algorithm thesis by xiaoyan2006 on 2007-04-04 21:21:07 as read along with 1 group VT_DLRL
  • Dijkstra's algorithm
    (2001), pp. 595-601.
    by Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford
    posted to algorithm thesis by xiaoyan2006 on 2007-04-04 18:59:51 as read along with 1 group VT_DLRL
  • Generalized best-first search strategies and the optimality af A*
    J. ACM, Vol. 32, No. 3. (July 1985), pp. 505-536.
    by Rina Dechter, Judea Pearl
    posted to algorithm thesis by xiaoyan2006 on 2007-04-04 18:49:47 as ** along with 2 people and 1 group bigga RBSCLUBFIJI VT_DLRL
  • Exploring the computing literature with visualization and stepping stones & pathways
    Commun. ACM, Vol. 49, No. 4. (April 2006), pp. 52-58.
    by Edward A Fox, Fernando D Neves, Xiaoyan Yu, Rao Shen, Seonho Kim, Weiguo Fan
    posted to sspw thesis by xiaoyan2006 on 2007-02-27 21:50:52 as read along with 4 people and 3 groups weiwu jonsmith lillejul ioannnis VT_DLRL pim L3S
  • Iterative Computing over a Unified Relationship Matrix for Information Integration
    (June 2006)
    by Wensi Xi
    posted to sim sspw thesis by xiaoyan2006 on 2007-02-27 21:18:09 as read along with 1 group VT_DLRL
  • Algorithms for storytelling
    (2006), pp. 604-610.
    by Deept Kumar, Naren Ramakrishnan, Richard F Helm, Malcolm Potts
    posted to sim sspw thesis by xiaoyan2006 on 2007-02-27 15:29:40 as read along with 1 group VT_DLRL
  • SimRank: a measure of structural-context similarity
    (2002), pp. 538-543.
    by Glen Jeh, Jennifer Widom
    posted to sim thesis by xiaoyan2006 on 2007-02-27 15:28:26 as read along with 9 people and 5 groups palakorn ChaTo ldietz arthur3131 weiwu RiccardoAlbertoni topher Scis0000002 flashfonic Drexel-HCI Drexel-eVoting VT_DLRL pim ImatiGESemantic
  • MRSSA: an iterative algorithm for similarity spreading over interrelated objects
    (2004), pp. 240-241.
    by Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Yong Yu, Wei-Ying Ma, Wensi Xi, Edward Fox
    posted to sim thesis by xiaoyan2006 on 2007-01-30 18:08:59 as read along with 1 group VT_DLRL
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/user/xiaoyan2006/tag/thesis

    Result page: 1 2 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.