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

michaelmampaey library [81 articles]

Статьи, недавно добавленные в библиотеку michaelmampaey .
  • Finding Trees From Unordered 0--1 Data
    (2006)
    by Hannes Heikinheimo, Heikki Mannila, Jouni K Seppänen
    posted to trees patterns mining interestingness datamining by michaelmampaey on 2008-06-13 14:15:32 as ** along with 1 group ADMiRes
  • 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 rules measure association by michaelmampaey on 2008-05-15 15:58:04 as ** along with 1 person and 1 group scorreia_pro ADMiRes
  • Computational aspects of mining maximal frequent patterns
    Theor. Comput. Sci., Vol. 362, No. 1. (October 2006), pp. 63-85.
    by Guizhen Yang
    posted to patterns mining itemsets complexity by michaelmampaey on 2008-05-05 10:53:21 as ** along with 1 group ADMiRes
  • 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 rules mining constraints by michaelmampaey on 2008-05-05 10:51:17 as ** along with 1 person and 1 group wilmegape ADMiRes
  • Mining the most interesting rules
    (1999), pp. 145-154.
    by Roberto J Bayardo, Rakesh Agrawal
    posted to rules mining interestingness association by michaelmampaey on 2008-05-05 10:50:25 as *** along with 4 people and 3 groups wilmegape duckysherwood feasel sunbird-lv unc_cs_eve UNC-FPM ADMiRes
  • An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
    LATIN 2004: Theoretical Informatics (2004), pp. 29-38.
    by Graham Cormode, S Muthukrishnan
    posted to streams sketch data by michaelmampaey on 2008-04-23 11:04:10 as ** along with 1 person mdreid
  • Efficient search for association rules
    (2000), pp. 99-107.
    by Geoffrey I Webb
    posted to association rules by michaelmampaey on 2008-04-16 16:09:18 as read along with 1 group ADMiRes
  • 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 on 2008-04-16 16:04:36 as read along with 1 person and 1 group imrchen ADMiRes
  • Compressing Large Boolean Matrices Using Reordering Techniques
    (2004)
    by D Johnson, S Krishnan, J Chhugani, S Kumar, S Venkatasubramanian
    posted to compression datamining itemsets by michaelmampaey on 2008-03-21 19:39:19 as read
  • DUSC: Dimensionality Unbiased Subspace Clustering
    (2007), pp. 409-414.
    by I Assent, R Krieger, E Muller, T Seidl
    posted to clustering by michaelmampaey on 2008-03-16 13:45:49 as read along with 1 group ADMiRes
  • notes 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 on 2008-03-12 11:53:52 as ** along with 1 group ADMiRes
  • Characterising the difference
    (2007), pp. 765-774.
    by Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
    posted to compression by michaelmampaey on 2008-03-12 10:03:44 as read
  • Item Sets that Compress
    (2006)
    by Arno Siebes, Jilles Vreeken, Matthijs van Leeuwen
    edited by Joydeep Ghosh, Diane Lambert, David B Skillicorn, Jaideep Srivastava, Joydeep Ghosh, Diane Lambert, David B Skillicorn, Jaideep Srivastava
    posted to compression itemsets by michaelmampaey on 2008-03-11 14:05:50 as read
  • 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 on 2008-03-10 10:00:37 as ** along with 5 people and 1 group yihu bluestan jago imrchen yuju ADMiRes
  • 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 on 2008-03-10 10:00:09 as ** along with 1 group ADMiRes
  • 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 on 2008-03-10 09:56:26 as ** along with 9 people and 5 groups jespera bluestan feasel tetsus QFRMC robincha jcsilva amsantos markymaypo unc_cs_eve QFRMC_ConsumerCredit UNC-FPM ADMiRes 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 on 2008-03-05 12:49:15 as ** along with 2 people and 1 group kistijantoro marciolima ADMiRes
  • Managing Gigabytes: Compressing and Indexing Documents and Images
    (15 May 1999)
    by Ian H Witten, Ian H Witten, Alistair Moffat, Timothy C Bell
    posted to compression data information-retrieval information-theory by michaelmampaey on 2008-03-05 09:46:30 as *** along with 16 people and 2 groups ansobol ChaTo dmeister jodal myelin mapio rozim leidner rahul pferguson damaru tolosoft mthomure caomo runson pprett SRL AI
  • 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 on 2008-02-28 12:34:40 as read along with 2 people and 2 groups jack marciolima Vision ADMiRes
  • 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 on 2008-02-26 20:45:18 as ** along with 2 people and 1 group marciolima runson ADMiRes
  • 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 on 2008-02-26 19:21:13 as read along with 1 group ADMiRes
  • A block-sorting lossless data compression algorithm.
    No. 124. (1994)
    by M Burrows, DJ Wheeler
    posted to algorithms compression information-theory lossless suffix by michaelmampaey on 2008-02-26 14:51:01 as read along with 5 people and 2 groups langmead msakai kistijantoro stanley rahul SRL ADMiRes
  • Reasoning about sets using redescription mining
    (2005), pp. 364-373.
    by Mohammed J Zaki, Naren Ramakrishnan
    posted to itemsets mining by michaelmampaey on 2008-02-22 13:21:31 as ** along with 2 people and 2 groups bigbossman xiaoyan2006 VT_DLRL ADMiRes
  • Selecting the right interestingness measure for association patterns
    (2002)
    by P Tan, V Kumar, J Srivastava
    posted to association interestingness measure patterns by michaelmampaey on 2008-02-14 15:16:05 as read along with 2 people and 1 group wilmegape ashko ADMiRes
  • Summarization - Compressing Data into an Informative Representation
    (2005), pp. 98-105.
    by Varun Chandola, Vipin Kumar
    posted to clustering compression itemsets summarization by michaelmampaey on 2008-02-07 10:59:10 as read
  • 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 on 2008-01-28 16:16:28 as *** along with 1 group ADMiRes
  • On the Structure of Armstrong Relations for Functional Dependencies
    J. ACM, Vol. 31, No. 1. (January 1984), pp. 30-46.
    by Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman
    posted to functional-dependencies relational by michaelmampaey on 2008-01-26 23:23:11 as read along with 1 group ADMiRes
  • 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 on 2008-01-17 22:23:05 as ** along with 1 group ADMiRes
  • Introduction to Lattices and Order
    (27 April 1990)
    by BA Davey, HA Priestley
    posted to lattices by michaelmampaey on 2008-01-17 16:09:19 as *** along with 1 person Scis0000002
  • Generating non-redundant association rules
    (2000), pp. 34-43.
    by Mohammed J Zaki
    posted to association redundancy rules by michaelmampaey on 2008-01-17 15:54:57 as read along with 1 group ADMiRes
  • Elements of Information Theory
    (12 August 1991)
    by Thomas M Cover, Joy A Thomas
    posted to information-theory by michaelmampaey on 2007-12-10 13:28:29 as **** along with 14 people Hans45 abellogin dpf ecome stanley yaroslavvb leidner bayesian BarrosH archroad infogrind kvorg pvfloripa zchen
  • An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
    (27 February 1997)
    by Ming Li, Paul Vitanyi
    posted to complexity compression information-theory kolmogorov by michaelmampaey on 2007-09-24 14:38:10 as *** along with 8 people and 1 group ansobol stanley BarrosH ddahlem scis0000001 rgb robertoalamino robotact pileWorks
  • Fully automatic cross-associations
    (2004), pp. 79-88.
    by Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S Modha, Christos Faloutsos
    posted to no-tag by michaelmampaey on 2007-09-17 10:42:56 as ** along with 1 group ADMiRes
  • 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 sorting suffix trees by michaelmampaey on 2007-09-09 14:48:31 as ** along with 1 group ADMiRes
  • Center-piece subgraphs: problem definition and fast solutions
    (2006), pp. 404-413.
    by Hanghang Tong, Christos Faloutsos
    posted to graphs by michaelmampaey on 2007-09-03 10:37:58 as ** along with 3 people and 2 groups uwenagel xiaoyan2006 azygmunt AGH-IISG ADMiRes
  • 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 community graphs network by michaelmampaey on 2007-08-31 12:21:43 as ** along with 12 people and 2 groups betaparticle ellakat tmmurali kuhn jfr lfriedl wilmegape gcalda ltabourier Scis0000002 maralena lmichan kdl ADMiRes
  • An algorithm to find overlapping community structure in networks
    (September 2007), pp. 91-102.
    by Steve Gregory
    posted to clustering community graphs network by michaelmampaey on 2007-08-24 14:21:39 as ** along with 1 person and 1 group wilmegape ADMiRes
  • CHARM: An Efficient Algorithm for Closed Itemset Mining
    by Mohammed J Zaki, Ching J Hsiao
    posted to closed datamining itemsets by michaelmampaey on 2007-07-17 15:26:44 as ** along with 1 group ADMiRes
  • Mining frequent patterns without candidate generation
    SIGMOD Rec., Vol. 29, No. 2. (June 2000), pp. 1-12.
    by Jiawei Han, Jian Pei, Yiwen Yin
    posted to datamining itemsets patterns by michaelmampaey on 2007-07-16 13:21:42 as ** along with 2 people and 2 groups Neptune coutinho ADMiRes Speed
  • Tiling Databases
    (2004)
    by Floris Geerts, Bart Goethals, Taneli Mielikäinen
    posted to datamining tiles by michaelmampaey on 2007-07-09 12:54:26 as read along with 1 group ADMiRes
  • Quick Inclusion-Exclusion
    Proceedings ECML-PKDD 2005 Workshop Knowledge Discovery in Inductive Databases, Vol. 3933 (2005)
    by T Calders, B Goethals
    posted to datamining entropy itemsets by michaelmampaey on 2007-07-04 15:38:01 as *** along with 1 group ADMiRes
  • Feasible itemset distributions in data mining: theory and application
    (June September-December 2003), pp. 284-295.
    by G Ramesh, WA Maniatty, MJ Zaki
    posted to datamining distributions itemsets patterns by michaelmampaey on 2007-07-04 10:30:44 as ** along with 1 group ADMiRes
  • Assessing data mining results via swap randomization
    (2006), pp. 167-176.
    by Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
    posted to datamining randomization by michaelmampaey on 2007-06-28 10:49:14 as read along with 1 group ADMiRes
  • A guided tour to approximate string matching
    ACM Computing Surveys, Vol. 33, No. 1. (2001), pp. 31-88.
    by Gonzalo Navarro
    posted to approximate edit-distance strings survey by michaelmampaey on 2007-06-13 19:36:21 as *** along with 11 people and 2 groups ianturton paulovn dmeister dmolla snowman parmentierf derek_farn pdlug myelin vidal31 zielaj inference-group ADMiRes
  • A mathematical theory of communication
    SIGMOBILE Mob. Comput. Commun. Rev., Vol. 5, No. 1. (January 2001), pp. 3-55.
    by CE Shannon
    posted to entropy information-theory by michaelmampaey on 2007-06-09 21:18:24 as *** along with 15 people and 1 group champak marti gfacciol almansa ssn ansobol chrn kristgy luispedro scottr davidmihalcik bigbossman lop alexzeh dcoates ADMiRes
  • Dynamic models for file sizes and double pareto distributions
    (2002)
    by M Mitzenmacher
    posted to no-tag by michaelmampaey on 2007-05-31 07:37:08 as ** along with 1 person and 1 group scis0000001 ADMiRes
  • Analysis of weighted networks
    (20 July 2004)
    by MEJ Newman
    posted to no-tag by michaelmampaey on 2007-05-31 07:26:06 as ** along with 20 people and 5 groups orahcio jmchauvet apwesolowski theus camster nettraq korakot devzero ldietz lfriedl tuck balicea kei_s entropy fukken AbnerCYH kubyaddi jaspervoskuilen gsthakur dpf Philosophy_of_Information dbk-lab Blog_and_Wiki_Research kdl ADMiRes
  • Biclustering algorithms for biological data analysis: a survey
    (2004)
    by S Madeira, A Oliveira
    posted to biclustering clustering by michaelmampaey on 2007-05-28 15:13:05 as ** along with 1 person and 2 groups raiyar steinmetzlab ADMiRes
  • Mining Approximate Frequent Itemsets In The Presence of Noise: Algorithm and Analysis
    (2006)
    by Jinze Liu, Susan Paulsen, Xing Sun, Wei Wang, Andrew B Nobel, Jan Prins
    posted to approximate datamining dense error itemsets patterns by michaelmampaey on 2007-05-14 13:45:19 as read along with 1 group ADMiRes
  • Mining Topk frequent closed patterns without minimum support
    (2002)
    by J Han, J Wang, Y Lu, P Tzvetkov
    posted to datamining itemsets patterns support by michaelmampaey on 2007-05-10 11:05:24 as *** along with 1 group ADMiRes
    • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/michaelmampaey

    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.