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

Group: ADMiRes - library [101 articles]

Недавние статьи, отправленные по почте членами ADMiRes группы
  • Finding Trees From Unordered 0--1 Data
    by Hannes H Heikki
    posted to trees patterns mining interestingness datamining 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 rules measure association 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 patterns mining itemsets complexity 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
  • 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
  • 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
  • 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
  • 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
  • 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 ***
  • A block-sorting lossless data compression algorithm.
    No. 124. (1994)
    by M Burrows, DJ Wheeler
  • Reasoning about sets using redescription mining
    (2005), pp. 364-373.
    by Mohammed J Zaki, Naren Ramakrishnan
  • 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 ***
  • 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 to the group ADMiRes on 2008-01-26 23:23:11 as read
  • 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 **
  • 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
  • Mining the most interesting rules
    (1999), pp. 145-154.
    by Roberto J Bayardo, Rakesh Agrawal
  • 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
  • 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 eabait fmatthes bigbossman
  • 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
  • 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 ***
  • 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.
    posted to trees suffix sorting by michaelmampaey to the group ADMiRes on 2007-09-09 14:48:31 as **
  • Center-piece subgraphs: problem definition and fast solutions
    (2006), pp. 404-413.
    by Hanghang Tong, Christos Faloutsos
  • 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
  • An algorithm to find overlapping community structure in networks
    (September 2007), pp. 91-102.
    by Steve Gregory
    posted to webmining social networks mining data by wilmegape to the group ADMiRes on 2007-08-21 15:04:31 as read along with 1 person michaelmampaey
  • Extracting semantic relations from query logs
    (2007), pp. 76-85.
    by Ricardo Baeza-Yates, Alessandro Tiberi
  • Correlation search in graph databases
    (2007), pp. 390-399.
    by Yiping Ke, James Cheng, Wilfred Ng
  • 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 2 people 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 **
  • Mining frequent patterns without candidate generation
    SIGMOD Rec., Vol. 29, No. 2. (June 2000), pp. 1-12.
    by Jiawei Han, Jian Pei, Yiwen Yin
  • Tiling Databases
    (2004)
    by Floris Geerts, Bart Goethals, Taneli Mielikäinen
    posted to tiles datamining by michaelmampaey to the group ADMiRes on 2007-07-09 12:54:26 as read
  • Quick Inclusion-Exclusion
    Proceedings ECML-PKDD 2005 Workshop Knowledge Discovery in Inductive Databases, Vol. 3933 (2005)
    posted to itemsets entropy datamining by michaelmampaey to the group ADMiRes on 2007-07-04 15:38:01 as **
  • 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 patterns itemsets distributions datamining by michaelmampaey to the group ADMiRes on 2007-07-04 10:30:44 as **
  • Assessing data mining results via swap randomization
    (2006), pp. 167-176.
    by Aristides Gionis, Heikki Mannila, Taneli Mielik&\#228;inen, Panayiotis Tsaparas
    posted to randomization datamining by michaelmampaey to the group ADMiRes on 2007-06-28 10:49:14 as read
  • A guided tour to approximate string matching
    ACM Computing Surveys, Vol. 33, No. 1. (2001), pp. 31-88.
    by Gonzalo Navarro
  • A mathematical theory of communication
    SIGMOBILE Mob. Comput. Commun. Rev., Vol. 5, No. 1. (January 2001), pp. 3-55.
    by CE Shannon
  • Dynamic models for file sizes and double pareto distributions
    (2002)
    posted to no-tag by michaelmampaey to the group ADMiRes on 2007-05-31 07:37:08 as *** along with 1 person scis0000001
  • Analysis of weighted networks
    (20 July 2004)
    by MEJ Newman
  • Biclustering algorithms for biological data analysis: a survey
    (2004)
  • Including Group-By in Query Optimization
    (1994), pp. 354-366.
    by Surajit Chaudhuri, Kyuseok Shim
    posted to relational query optimization group-by databases by wilmegape to the group ADMiRes on 2007-05-15 09:35:43 as read
  • 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 patterns itemsets error dense datamining approximate by michaelmampaey to the group ADMiRes on 2007-05-14 13:45:19 as read
  • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/group/2400

    Result page: 1 2 3 Next RIS BibTeX RSS
    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.