Filters








13,866 Hits in 5.7 sec

Pinpoint Clustering of Web Pages and Mining Implicit Crossover Concepts [chapter]

Makoto Haraguchi, Yoshiaki Okubo
2010 Web Intelligence and Intelligent Agents  
Computation of Top-N Weighted Pseudo-Cliques Let G = (V, E) be an weighted graph we are concerned with. In our search, for a clique Q in G, we try to find a τ-valid pseudo-cliqueC whose core is Q.  ...  Such a system is, however, not always helpful for finding our Top-N formal concepts satisfying some constraints.  ...  collection of research work ranging from controlling the activities in virtual world to optimization of productivity in games, from collaborative recommendations to populate an open computational environment with  ... 
doi:10.5772/8380 fatcat:l5d4fefcfvdl3dzc6o7m42jmca

NextClosures: parallel computation of the canonical base with background knowledge

Francesco Kriegel, Daniel Borchmann
2017 International Journal of General Systems  
The canonical base of a formal context plays a distinguished role in Formal Concept Analysis, as it is the only minimal implicational base known so far that can be described explicitly.  ...  First experimental evaluations show that for sufficiently large data sets the speed-up is proportional to the number of available CPU cores.  ...  Acknowledgements The authors gratefully thank Bernhard Ganter for his helpful hints on optimal formal contexts for his NextClosure algorithm.  ... 
doi:10.1080/03081079.2017.1349570 fatcat:gnrogf6kizdgtga4r3szeagkzi

Knowledge Cores in Large Formal Contexts [article]

Tom Hanika, Johannes Hirth
2020 arXiv   pre-print
This is in particular true when deriving knowledge bases in formal concept analysis (FCA). Hence, it is essential to come up with techniques to cope with this problem.  ...  This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts data sets.  ...  It can be computed using pseudo-intents, i.e., P ⊆ M with P = P and Q P holds for every pseudo-intent Q P . The recursive nature of this definition is by design.  ... 
arXiv:2002.11776v1 fatcat:7nkykkajxfev7au46qlzqbhw44

Formal Concept Analysis and Semantic File Systems [chapter]

Ben Martin
2004 Lecture Notes in Computer Science  
. . . . . . . . . . . . . . 73 5.1 At the top of the figure is a Formal Context with one of its Formal Attributes and one of its Formal Objects highlighted.  ...  An introduced formal attribute is a formal attribute for which this concept is the highest one in the lattice with that attribute.  ... 
doi:10.1007/978-3-540-24651-0_9 fatcat:avv7sistozh3pinob4cgyzbm7e

An Approach Using Concept Lattice Structure for Data Mining and Information Retrieval

Tran Lam Quan, Vu Tat Thang
2015 Journal of Science and Technology Issue on Information and Communications Technology  
The formal concept analysis - FCA is one of the main techniques applied in the concept lattice.  ...  The algorithm for the construction of concept lattice will install a couple on each node, including a set of documents with common terms, and a set of terms which co-occurs in documents.  ...  from null. • Top of lattice G, ∅ is intent is null.  ... 
doi:10.31130/jst.2015.4 fatcat:z2wk4k452rehnafbeexlybfjvm

LIA at the NTCIR-10 INTENT Task

Romain Deveaud, Eric SanJuan
2013 NTCIR Conference on Evaluation of Information Access Technologies  
This paper describes the participation of the LIA team in the English Subtopic Mining subtask of the NTCIR-10 INTENT-2 Task.  ...  Our motivation was to take a conceptual approach, therefore representing the query by a set of concepts before identifying the related subtopics.  ...  For our participation to the NTCIR-10 INTENT Subtopic Mining task [9] , we wanted to model the core concepts of a query in order to better identify clusters of subtopics.  ... 
dblp:conf/ntcir/DeveaudS13 fatcat:wa6aukcxjzdwflogvw2gcmfg3y

Object-Attribute Biclustering for Elimination of Missing Genotypes in Ischemic Stroke Genome-Wide Data [article]

Dmitry I. Ignatov and Gennady V. Khvorykh and Andrey V. Khrunin and Stefan Nikolić and Makhmud Shaban and Elizaveta A. Petrova and Evgeniya A. Koltsova and Fouzi Takelait and Dmitrii Egurnov
2020 arXiv   pre-print
To tackle this issue, we used well-developed notions of object-attribute biclusters and formal concepts that correspond to dense subrelations in the binary relation patients×SNPs.  ...  The proposed algorithm was also able to generate biclusters for the whole dataset without size constraints in comparison to the In-Close4 algorithm for generation of formal concepts.  ...  an output formal concept, and m, nN).  ... 
arXiv:2010.11641v2 fatcat:zx2v2ypud5hs7ccafwnyvbijje

Triadic Formal Concept Analysis and triclustering: searching for optimal patterns

Dmitry I. Ignatov, Dmitry V. Gnatyshak, Sergei O. Kuznetsov, Boris G. Mirkin
2015 Machine Learning  
An ideal triadic pattern is a totally dense maximal cuboid (formal triconcept).  ...  Relaxations of this notion under consideration are: OAC-triclusters; triclusters optimal with respect to the leastsquare criterion; and graph partitions obtained by using spectral clustering.  ...  One may introduce n-adic formal concepts without n-ary concept forming operators.  ... 
doi:10.1007/s10994-015-5487-y fatcat:qpedyeugvzgmbaidv3izlhcvja

Interval-Dismantling for Lattices [article]

Maximilian Felde, Maren Koyda
2022 arXiv   pre-print
We utilize theory from Formal Concept Analysis (FCA) to show that lattices dismantled by intervals correspond to closed subrelations in the respective formal context, and that there exists a unique kernel  ...  with respect to dismantling by intervals.  ...  A pair c = (A, B) with A ⊆ G and B ⊆ M is called formal concept of the formal context K = (G, M, I) if A = B and B = A hold. Then, A is called the extent and B is called the intent of c.  ... 
arXiv:2208.01479v1 fatcat:tm5qyzjavvbi3f75kllv6bpz7m

Cross-Face Centrality: A new Measure for Identifying key Nodes in Networks Based on Formal Concept Analysis

Mohamed Hamza Ibrahim, Rokia Missaoui, Jean Vaillancourt.
2020 IEEE Access  
3.1 (Symmetrical concept): A formal concept c = (A, B), with extent A and intent B, is called a symmetrical concept if A = B, i.e., its extent is identical to its intent.  ...  VOLUME 4, 2016 Definition 2.5 (Formal concept): The pair c = (A, B) is called a formal concept of K with extent A and intent B if both A and B are closed and A = B, and B = A.  ... 
doi:10.1109/access.2020.3038306 fatcat:sw2hpkymgzhufhe74igxuzssci

Object-Attribute Biclustering for Elimination of Missing Genotypes in Ischemic Stroke Genome-Wide Data [article]

Dmitry I. Ignatov, Gennady V. Khvorykh, Andrey V. Khrunin, Stefan Nikolic, Makhmud Shaban, Elizaveta A. Petrova, Evgeniya A. Koltsova, Fouzi Takelait, Dmitrii Egurnov
2020 bioRxiv   pre-print
To tackle this issue, we used well-developed notions of object-attribute biclusters and formal concepts that correspond to dense subrelations in the binary relation patients x SNPs.  ...  The proposed algorithm was also able to generate biclusters for the whole dataset without size constraints in comparison to the In-Close4 algorithm for generation of formal concepts.  ...  an output formal concept, and m, nN).  ... 
doi:10.1101/2020.10.22.349910 fatcat:qo3az4l3sjhata6n7fuqc5ys6m

A Lattice-Based Semantic Location Model for Indoor Navigation

Dandan Li, Dik Lun Lee
2008 The Ninth International Conference on Mobile Data Management (mdm 2008)  
LSLM is based on the exit-location model and the theory of "formal concept analysis."  ...  The nearest neighbor relationship on the concept lattice is used to define the optimal distance between two entities.  ...  Section 3 reviews the basic concepts of formal concept lattice, which are the foundation of the core subjects of the paper.  ... 
doi:10.1109/mdm.2008.11 dblp:conf/mdm/LiL08 fatcat:n3savtbnrjdpticerg7bdm67da

On Computing the Minimal Generator Family for Concept Lattices and Icebergs [chapter]

Kamal Nehmé, Petko Valtchev, Mohamed H. Rouane, Robert Godin
2005 Lecture Notes in Computer Science  
etc., takes over the core tasks of computing intents and mingen.  ...  The closure computation used by Titanic to find concept intents depends to a much lesser degree on the number of concepts in the iceberg and therefore the performances of the algorithm vary in a narrow  ... 
doi:10.1007/978-3-540-32262-7_13 fatcat:xhivdzsn4navvnwishvwsbby2i

Preference-based top-k spatial keyword queries

Jinzeng Zhang, Dongqi Liu, Xiaofeng Meng
2011 Proceedings of the 1st international workshop on Mobile location-based service - MLBS '11  
In this paper, we de Preferencebased Top-k Spatial Keyword(PTkSK) query for coping with fuzzy labels.  ...  One reason for those queries contain fuzzy linguistic labels that often embody users' preference, e.g., finding hotels near Zhongguancun with moderate price.  ...  Section 3 formally defines problems and concepts.  ... 
doi:10.1145/2025876.2025883 fatcat:ozsak2ggvbgezg365whkltg7wi

BJTU TRECVID 2007 Video Search

Shikui Wei, Yao Zhao, Zhenfeng Zhu, Nan Liu, Yufeng Zhao, Fang Wang, Xie Lin
2007 TREC Video Retrieval Evaluation  
According to their relevance to query intention, clusters on each feature view are mapped into predefined ranks.  ...  This year we participated in the automatic video search subtask, and submitted six runs with different combination of approaches to NIST.  ...  Given a fixed N shots, feature representation of each shot is considered as a vertex of set V, and set E consists of N by N edges with a weight matrix W of edges.  ... 
dblp:conf/trecvid/WeiZZZLZZWL07 fatcat:zctwxq6ogrb2jepzprnuy6ppy4
« Previous Showing results 1 — 15 out of 13,866 results