Регистрация | Вход в службу | FAQ      [?] 
Recent | Recommended | Search | Authors | Tags | Export

Group: ADMiRes - library [107 articles]

Недавние статьи, отправленные по почте членами ADMiRes группы
  • Data Mining, Second Edition, Second Edition : Concepts and Techniques (The Morgan Kaufmann Series in Data Management Systems) (The Morgan Kaufmann Series in Data Management Systems)
    (13 January 2006)
    by Jiawei Han, Micheline Kamber
    posted to book data mining by cgarboni to the group ADMiRes on 2007-09-27 14:01:01 as ***** along with 3 people fmatthes bigbossman eabait
  • A universal algorithm for sequential data compression
    Information Theory, IEEE Transactions on, Vol. 23, No. 3. (1977), pp. 337-343.
    by J Ziv, A Lempel
    posted to compression data information-theory text by michaelmampaey to the group ADMiRes on 2008-02-28 12:34:40 as *** along with 2 people and 1 group jack marciolima Vision
  • A Method for the Construction of Minimum-Redundancy Codes
    Proceedings of the IRE, Vol. 40, No. 9. (1952), pp. 1098-1101.
    by DA Huffman
    posted to algorithms compression information-theory redundancy by michaelmampaey to the group ADMiRes on 2008-02-26 19:21:13 as *** along with 1 person dmeister
  • A block-sorting lossless data compression algorithm.
    No. 124. (1994)
    by M Burrows, DJ Wheeler
    posted to algorithms compression lossless suffix by michaelmampaey to the group ADMiRes on 2008-02-26 14:51:01 as *** along with 5 people and 1 group kistijantoro stanley rahul msakai langmead SRL
  • Reasoning about sets using redescription mining
    (2005), pp. 364-373.
    by Mohammed J Zaki, Naren Ramakrishnan
    posted to itemsets mining by michaelmampaey to the group ADMiRes on 2008-02-22 13:21:31 as *** along with 2 people and 1 group bigbossman xiaoyan2006 VT_DLRL
  • Selecting the right interestingness measure for association patterns
    (2002)
    by P Tan, V Kumar, J Srivastava
    posted to association interestingness measures rules by wilmegape to the group ADMiRes on 2008-02-12 16:32:36 as *** along with 2 people michaelmampaey ashko
  • Basic Association Rules
    (2004)
    by Guichong Li, Howard J Hamilton
    edited by Michael W Berry, Umeshwar Dayal, Chandrika Kamath, David B Skillicorn, Michael W Berry, Umeshwar Dayal, Chandrika Kamath, David B Skillicorn
    posted to association redundancy rules by michaelmampaey to the group ADMiRes on 2008-01-28 16:16:28 as ***
  • Generating non-redundant association rules
    (2000), pp. 34-43.
    by Mohammed J Zaki
    posted to association redundancy rules by michaelmampaey to the group ADMiRes on 2008-01-17 15:54:58 as ***
  • Constraint-Based Rule Mining in Large, Dense Databases
    Data Mining and Knowledge Discovery, Vol. 4, No. 2. (10 July 2000), pp. 217-240.
    by Roberto Bayardo, Rakesh Agrawal, Dimitrios Gunopulos
    posted to association constraints datamining dense improvement mining rules by wilmegape to the group ADMiRes on 2007-10-16 15:14:20 as *** along with 1 person michaelmampaey
  • Mining the most interesting rules
    (1999), pp. 145-154.
    by Roberto J Bayardo, Rakesh Agrawal
    posted to datamining interestingness measures metrics mining rules by wilmegape to the group ADMiRes on 2007-10-15 15:37:56 as *** along with 4 people and 2 groups duckysherwood feasel sunbird-lv michaelmampaey unc_cs_eve UNC-FPM
  • Object Distinction: Distinguishing Objects with Identical Names
    Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on (2007), pp. 1242-1246.
    by Xiaoxin Yin, Jiawei Han, PS Yu
    posted to datamining links network social by wilmegape to the group ADMiRes on 2007-09-27 13:13:12 as ***
  • Towards Mining Frequent Queries in Star Schemes
    Knowledge Discovery in Inductive Databases (2006), pp. 104-123.
    by Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos, Oumar Sy
    posted to datamining mining queries by wilmegape to the group ADMiRes on 2007-09-27 10:15:32 as ***
  • Center-piece subgraphs: problem definition and fast solutions
    (2006), pp. 404-413.
    by Hanghang Tong, Christos Faloutsos
    posted to graphs by michaelmampaey to the group ADMiRes on 2007-09-03 10:37:58 as *** along with 3 people and 1 group xiaoyan2006 azygmunt uwenagel AGH-IISG
  • Uncovering the overlapping community structure of complex networks in nature and society
    Nature, Vol. 435, No. 7043., pp. 814-818.
    by Gergely Palla, Imre Derényi, Illés Farkas, Tamás Vicsek
    posted to webmining structure overlap networks mining data community by wilmegape to the group ADMiRes on 2007-08-31 14:51:09 as *** along with 12 people and 1 group kuhn jfr lfriedl gcalda ltabourier michaelmampaey Scis0000002 maralena lmichan ellakat tmmurali betaparticle kdl
  • Correlation search in graph databases
    (2007), pp. 390-399.
    by Yiping Ke, James Cheng, Wilfred Ng
    posted to webmining mining graph databases data by wilmegape to the group ADMiRes on 2007-08-21 14:19:47 as *** along with 2 people and 1 group bigbossman AbnerCYH CSBBGraphTheory
  • A guided tour to approximate string matching
    ACM Computing Surveys, Vol. 33, No. 1. (2001), pp. 31-88.
    by Gonzalo Navarro
    posted to survey strings edit-distance approximate by michaelmampaey to the group ADMiRes on 2007-06-13 19:36:21 as *** along with 11 people and 1 group dmolla snowman parmentierf derek_farn pdlug myelin vidal31 zielaj dmeister paulovn ianturton inference-group
  • A mathematical theory of communication
    SIGMOBILE Mob. Comput. Commun. Rev., Vol. 5, No. 1. (January 2001), pp. 3-55.
    by CE Shannon
    posted to information-theory entropy by michaelmampaey to the group ADMiRes on 2007-06-09 21:18:24 as *** along with 17 people Hans45 jhardin ssn ansobol chrn kristgy luispedro scottr davidmihalcik bigbossman lop alexzeh dcoates almansa champak marti gfacciol
  • Dynamic models for file sizes and double pareto distributions
    (2002)
    by M Mitzenmacher
    posted to no-tag by michaelmampaey to the group ADMiRes on 2007-05-31 07:37:08 as *** along with 1 person scis0000001
  • Mining Topk frequent closed patterns without minimum support
    (2002)
    by J Han, J Wang, Y Lu, P Tzvetkov
    posted to support patterns itemsets datamining by michaelmampaey to the group ADMiRes on 2007-05-10 11:05:24 as ***
  • A Tight Upper Bound on the Number of Candidate Patterns
    (2001), pp. 155-162.
    by Floris Geerts, Bart Goethals, Jan Van den Bussche
    posted to patterns itemsets datamining by michaelmampaey to the group ADMiRes on 2007-05-10 11:03:51 as *** along with 1 person yangxian
  • Discovery of Functional and Approximate Functional Dependencies in Relational Databases
    Journal of Applied Mathematics and Decision Sciences, Vol. 7, No. 1. (2003), pp. 49-59.
    by RS King, JJ Legendre
    posted to relational functional dependencies databases approximate by wilmegape to the group ADMiRes on 2007-04-06 14:52:14 as ***
  • Collective dynamics of 'small-world' networks.
    Nature, Vol. 393, No. 6684. (4 June 1998), pp. 440-442.
    by DJ Watts, SH Strogatz
    posted to network graphs datamining by michaelmampaey to the group ADMiRes on 2007-03-28 15:37:45 as *** along with 75 people and 12 groups jmenche chrisdubois tharris MehdiMoussaid jobriath camster G_RAM kewms KAllendoerfer AdrianMiles mague alexisgallagher Rsavi zqshen shivaram cmmorel Shirakawa tolosoft nithya nygaard balicea dumpa matteodellamico yoh dullhunk voiklis eldaly ianturton merazzle maqbes muraken zono zeroknowledge choonpeng cerkut xinian mmartin king amac adriandefroment RafG radale jaspervoskuilen timflutre pbrandao sugaya ruvido rsantana cjeans fbaroni rcrane ransombriggs suizan lpfernandes sbianco kb kaks stefanoallesina beete teferet ladamic iris_2001 livingthingdan jsanpedro jotwin ulmer takeha-e dylanwalker mpotamias jpbarrette Borelli jago ddahlem ilkert tomhebbron Network Data Repository C. elegans / WormBase dbk-lab GraphVis Semantic-Social-Networks microRNA Web2 Soslab CooperationStudies ColDyn contact-id 801
  • Constraint Based Mining of First Order Sequences in SeqLog
    Proceedings KDID?02 co-located with ECML-PKDD?02
    by SD Lee, L De Raedt
    posted to sequences rules mining logic ilp by wilmegape to the group ADMiRes on 2007-02-05 20:31:41 as ***
  • Elements of Information Theory 2nd Edition
    (18 July 2006)
    by Thomas M Cover, Joy A Thomas
    posted to information-theory by michaelmampaey to the group ADMiRes on 2008-10-03 14:23:36 as ** along with 12 people danielaugot ansobol mshafiei sbarthelme bayes nmdang alexzeh fjanoos BrianTomasik MBFalcon quianominorleo soramame_0518
  • Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
    (2008), pp. 758-766.
    by Yang Xiang, Ruoming Jin, David Fuhry, Feodor F Dragan
    posted to tiles summarization by michaelmampaey to the group ADMiRes on 2008-09-26 14:53:05 as **
  • Decomposable Families of Itemsets
    Vol. 5212 (2008), pp. 472-487.
    by Nikolaj Tatti, Hannes Heikinheimo
    edited by Walter Daelemans, Bart Goethals, Katharina Morik, Walter Daelemans, Bart Goethals, Katharina Morik
    posted to summarization itemsets information-theory by michaelmampaey to the group ADMiRes on 2008-09-26 13:43:21 as **
  • Minimum-Size Bases of Association Rules
    Vol. 5211 (2008), pp. 86-101.
    by José L Balcázar
    edited by Walter Daelemans, Bart Goethals, Katharina Morik, Walter Daelemans, Bart Goethals, Katharina Morik
    posted to rules association by michaelmampaey to the group ADMiRes on 2008-09-26 13:42:43 as **
  • Mining Conjunctive Sequential Patterns
    Vol. 5211 (2008)
    by Chedy Ra\issi, Toon Calders, Pascal Poncelet
    edited by Walter Daelemans, Bart Goethals, Katharina Morik, Walter Daelemans, Bart Goethals, Katharina Morik
    posted to sequence patterns mining by michaelmampaey to the group ADMiRes on 2008-09-26 13:42:10 as **
  • Adequate Condensed Representations of Patterns
    Vol. 5211 (2008), pp. 20-21.
    by Arnaud Soulet, Bruno Crémilleux
    edited by Walter Daelemans, Bart Goethals, Katharina Morik, Walter Daelemans, Bart Goethals, Katharina Morik
    posted to representations patterns itemsets condensed by michaelmampaey to the group ADMiRes on 2008-09-26 13:41:31 as **
  • Finding Trees From Unordered 0--1 Data
    by Hannes H Heikki
    posted to datamining interestingness mining patterns trees by michaelmampaey to the group ADMiRes on 2008-06-13 14:15:32 as **
  • Association Mining in Large Databases: A Re-examination of Its Measures
    Knowledge Discovery in Databases: PKDD 2007 (2007), pp. 621-628.
    by Tianyi Wu, Yuguo Chen, Jiawei Han
    posted to association measure rules by michaelmampaey to the group ADMiRes on 2008-05-15 15:58:04 as ** along with 1 person scorreia_pro
  • Computational aspects of mining maximal frequent patterns
    Theor. Comput. Sci., Vol. 362, No. 1. (October 2006), pp. 63-85.
    by Guizhen Yang
    posted to complexity itemsets mining patterns by michaelmampaey to the group ADMiRes on 2008-05-05 10:53:21 as **
  • Efficient search for association rules
    (2000), pp. 99-107.
    by Geoffrey I Webb
    posted to association rules by michaelmampaey to the group ADMiRes on 2008-04-16 16:09:18 as **
  • Finding interesting associations without support pruning
    Transactions on Knowledge and Data Engineering, Vol. 13, No. 1. (2001), pp. 64-78.
    by E Cohen, M Datar, S Fujiwara, A Gionis, P Indyk, R Motwani, JD Ullman, C Yang
    posted to association interestingness support by michaelmampaey to the group ADMiRes on 2008-04-16 16:04:36 as ** along with 1 person imrchen
  • DUSC: Dimensionality Unbiased Subspace Clustering
    (2007)
    by I Assent, R Krieger, E Muller, T Seidl
    posted to clustering by michaelmampaey to the group ADMiRes on 2008-03-16 13:45:49 as **
  • Finding low-entropy sets and trees from binary data
    (2007), pp. 350-359.
    by Hannes Heikinheimo, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen, Jouni K Seppänen
    posted to entropy patterns by michaelmampaey to the group ADMiRes on 2008-03-12 11:53:53 as **
  • Discovery of Frequent Episodes in Event Sequences
    Data Mining and Knowledge Discovery, Vol. 1, No. 3. (1997), pp. 259-289.
    by Heikki Mannila, Hannu Toivonen, Inkeri A Verkamo
    posted to algorithms mining patterns sequence by michaelmampaey to the group ADMiRes on 2008-03-10 10:00:37 as ** along with 5 people yuju yihu bluestan imrchen jago
  • An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
    (2000), pp. 13-23.
    by Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
    posted to algorithms graph mining patterns by michaelmampaey to the group ADMiRes on 2008-03-10 10:00:09 as **
  • Mining sequential patterns
    (1995), pp. 3-14.
    by Rakesh Agrawal, Ramakrishnan Srikant
    edited by Philip S Yu, Arbee SP Chen
    posted to mining patterns sequence by michaelmampaey to the group ADMiRes on 2008-03-10 09:56:26 as ** along with 9 people and 4 groups jespera bluestan feasel tetsus QFRMC robincha jcsilva amsantos markymaypo unc_cs_eve QFRMC_ConsumerCredit UNC-FPM ARTFL
  • Compression of Individual Sequences via Variable-Rate Coding
    IEEE Transactions on Information Theory, Vol. 24, No. 5. (1978), pp. 530-536.
    by Jacob Ziv, Abraham Lempel
    posted to compression data information-theory strings by michaelmampaey to the group ADMiRes on 2008-03-05 12:49:15 as ** along with 2 people kistijantoro marciolima
  • Text Compression (Prentice Hall Advanced Reference Series)
    (16 January 1990)
    by Timothy C Bell, John G Cleary, Ian H Witten
    posted to compression information-theory by michaelmampaey to the group ADMiRes on 2008-02-26 20:45:18 as ** along with 2 people marciolima runson
  • Discovering all most specific sentences
    ACM Trans. Database Syst., Vol. 28, No. 2. (June 2003), pp. 140-174.
    by Dimitrios Gunopulos, Roni Khardon, Heikki Mannila, Sanjeev Saluja, Hannu Toivonen, Ram S Sharma
    posted to no-tag by michaelmampaey to the group ADMiRes on 2008-01-17 22:23:05 as **
  • Data Mining: Introductory and Advanced Topics
    (22 August 2002)
    by Margaret H Dunham
    posted to no-tag by cgarboni to the group ADMiRes on 2007-09-27 14:10:54 as ** along with 2 people and 1 group AbnerCYH kklo CSBBGraphTheory
  • CrossMine: Efficient Classification Across Multiple Database Relations
    (2004)
    by X Yin, J Han, J Yang, PS Yu
    posted to classification databases datamining relational by wilmegape to the group ADMiRes on 2007-09-27 13:16:31 as ** along with 1 person smck
  • LinkClus: efficient clustering via heterogeneous semantic links
    (2006), pp. 427-438.
    by Xiaoxin Yin, Jiawei Han, Philip S Yu
    posted to clustering datamining links network by wilmegape to the group ADMiRes on 2007-09-27 13:15:26 as ** along with 1 person and 1 group azygmunt AGH-IISG
  • Fully automatic cross-associations
    (2004), pp. 79-88.
    by Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S Modha, Christos Faloutsos
    posted to no-tag by michaelmampaey to the group ADMiRes on 2007-09-17 10:42:56 as **
  • On the sorting-complexity of suffix tree construction
    J. ACM, Vol. 47, No. 6. (November 2000), pp. 987-1011.
    by Martin Farach-Colton, Paolo Ferragina, S Muthukrishnan
    posted to trees suffix sorting by michaelmampaey to the group ADMiRes on 2007-09-09 14:48:31 as **
  • Extracting semantic relations from query logs
    (2007), pp. 76-85.
    by Ricardo Baeza-Yates, Alessandro Tiberi
    posted to semantic relations query mining logs databases data by wilmegape to the group ADMiRes on 2007-08-21 14:21:20 as ** along with 8 people donade xiaoyan2006 vitalaswp4 boila mpotamias ejmeij dlaguardia dreamedge
  • Structural and temporal analysis of the blogosphere through community factorization
    (2007), pp. 163-172.
    by Yun Chi, Shenghuo Zhu, Xiaodan Song, Junichi Tatemura, Belle L Tseng
    posted to webmining mining databases data by wilmegape to the group ADMiRes on 2007-08-21 14:17:00 as ** along with 3 people dreamedge bigbossman fabianabel
  • CHARM: An Efficient Algorithm for Closed Itemset Mining
    by Mohammed J Zaki, Ching J Hsiao
    posted to itemsets datamining closed by michaelmampaey to the group ADMiRes on 2007-07-17 15:26:44 as **
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/group/2400/order/to_read

    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.