Filters








26,389 Hits in 5.8 sec

Popularity-guided top-kextraction of entity attributes

Matthew Solomon, Cong Yu, Luis Gravano
2010 Procceedings of the 13th International Workshop on the Web and Databases - WebDB '10  
We present a top-k extraction processing approach that addresses both the quality and efficiency challenges: for each entity and attribute of interest, we return the top-k values of the attribute for the  ...  Overall, our top-k extraction processing approach manages to identify the top attribute values for the entities of interest efficiently, as we demonstrate with a large-scale experimental evaluation over  ...  EXTRACTING TOP-K VALUES Our goal is to extract the top-k values of a given attribute for a given set of entities, using an information extraction system over a set of documents D.  ... 
doi:10.1145/1859127.1859139 dblp:conf/webdb/SolomonYG10 fatcat:mkphu6vw7nhxzf6vrw37irsdrm

When recommendation meets mobile

Jinfeng Zhuang, Tao Mei, Steven C.H. Hoi, Ying-Qing Xu, Shipeng Li
2011 Proceedings of the 13th international conference on Ubiquitous computing - UbiComp '11  
Specifically, it estimates the generation probability of an entity by a given user conditioned on the current context in a probabilistic framework.  ...  We show that the application is effective to facilitate the exploration and discovery of surroundings for mobile users.  ...  By re- viewing the attributes of the top ranked entities, the activity of users may be affected positively or guided by the recommendation results.  ... 
doi:10.1145/2030112.2030134 dblp:conf/huc/ZhuangMHXL11 fatcat:lmullxqsajcyfc3scojszlhh3u

Hierarchical Relation-Guided Type-Sentence Alignment for Long-Tail Relation Extraction with Distant Supervision [article]

Yang Li, Guodong Long, Tao Shen, Jing Jiang
2021 arXiv   pre-print
One solution is resorting to entity types, but open questions remain about how to fully leverage the information of entity types and how to align multi-granular entity types with sentences.  ...  However, a coarse-grained relation often implies only an attribute (e.g., domain or topic) of the distant fact, making it hard to discriminate relations based solely on sentence semantics.  ...  One popular source is the entity types, i.e., an entity's "ISA" attributes in KG, which characterizes the entity from multiple perspectives (Chen et al. 2020 ).  ... 
arXiv:2109.09036v1 fatcat:h2dsow3xebgpfgmhgawdrbj5he

Open Knowledge Enrichment for Long-tail Entities [article]

Ermei Cao and Difeng Wang and Jiacheng Huang and Wei Hu
2020 arXiv   pre-print
Prior knowledge from popular entities is leveraged to improve every enrichment step.  ...  However, they only tackle a part of the enrichment problem and lack specific considerations regarding long-tail entities.  ...  We create an edge between an entity node and each of its top-k similar entity nodes.  ... 
arXiv:2002.06397v2 fatcat:tgff2du335a23blbqxlr5d6gjq

Automatic extraction of top-k lists from the web

Zhixian Zhang, K. Q. Zhu, Haixun Wang, Hongsong Li
2013 2013 IEEE 29th International Conference on Data Engineering (ICDE)  
This paper is concerned with information extraction from top-k web pages, which are web pages that describe top k instances of a topic which is of general interest.  ...  Specifically, we extract more than 1.7 million top-k lists from a web corpus of 1.6 billion pages with 92.0% precision and 72.3% recall.  ...  free-text information, and guide their extraction.  ... 
doi:10.1109/icde.2013.6544897 dblp:conf/icde/ZhangZWL13 fatcat:pnjgttbxhvg7npfqwbudttleae

Wikipedia entity expansion and attribute extraction from the web using semi-supervised learning

Lidong Bing, Wai Lam, Tak-Lam Wong
2013 Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13  
We develop a new framework to achieve the goal of Wikipedia entity expansion and attribute extraction from the Web.  ...  of more entities for this category and the attribute content of the newly discovered entities.  ...  We first report the result of precision at K (P@K) where K is the number of entities considered from the top of the ranked output list by a method.  ... 
doi:10.1145/2433396.2433468 dblp:conf/wsdm/BingLW13 fatcat:wscamx4trbftdh6kdonbyrczlu

Referring Image Segmentation via Cross-Modal Progressive Comprehension [article]

Shaofei Huang, Tianrui Hui, Si Liu, Guanbin Li, Yunchao Wei, Jizhong Han, Luoqi Liu, Bo Li
2020 arXiv   pre-print
Concretely, the CMPC module first employs entity and attribute words to perceive all the related entities that might be considered by the expression.  ...  We conduct extensive experiments on four popular referring segmentation benchmarks and achieve new state-of-the-art performances.  ...  First, linguistic features of entity words and attribute words (e.g., "man" and "white frisbee") extracted from the expression are fused with visual features extracted from the image to form multimodal  ... 
arXiv:2010.00514v1 fatcat:ywbhpiepbrfb3knsnlrv5dhd4m

Data clouds

Georgia Koutrika, Zahra Mohammadi Zadeh, Hector Garcia-Molina
2009 Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09  
We propose using clouds over structured data (data clouds) to summarize the results of keyword searches over structured data and to guide users to refine their searches.  ...  We present several methods to compute the scores both for the entities and for the terms in the search results.  ...  We want to compute a significance score for each term k contained in the search entities of Vq. The top terms can be then used as a summary S of the results and guide search refinement.  ... 
doi:10.1145/1516360.1516406 dblp:conf/edbt/KoutrikaZG09 fatcat:6htybnzc5bcaffkth6w3gratra

Closing the loop in webpage understanding

Chunyu Yang, Yong Cao, Zaiqing Nie, Jie Zhou, Ji-Rong Wen
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
In this top-down integration model, the decision of the HCRF model could guide the decision-making of the Semi-CRF model.  ...  We have applied the proposed framework to local business entity extraction and Chinese person and organization name extraction.  ...  In this top-down integration model, the decision of the HCRF model could guide the decision of the Semi-CRF model.  ... 
doi:10.1145/1458082.1458298 dblp:conf/cikm/YangCNZW08 fatcat:ji2jv5wfmzeeti77gnwp32vspi

A review of text-based recommendation systems

Safia Kanwal, Sidra Nawaz, Muhammad Kamran Malik, Zubair Nawaz
2021 IEEE Access  
But we have consolidated all the attributes of these publically available and proprietary datasets to familiarize these attributes to new researchers.  ...  We have presented an overview of these evaluation metrics and diagramed them according to their popularity.  ...  P@k is the precision of top-k items that are good, R@k is the recall of top-k good items and similarly, F/F1@k is the F-measure of top-k items that are in the recommendation list.  ... 
doi:10.1109/access.2021.3059312 fatcat:bphgcu3rzng2fbbynlaeo3moyy

User Friendly Automatic Construction of Background Knowledge

Alexander L. Hayes, Mayukh Das, Phillip Odom, Sriraam Natarajan
2017 Proceedings of the Knowledge Capture Conference on - K-CAP 2017  
One of the key advantages of Inductive Logic Programming systems is the ability of the domain experts to provide background knowledge as modes that allow for efficient search through the space of hypotheses  ...  We relax this assumption by designing a graphical user interface that allows the domain expert to interact with the system using Entity Relationship diagrams.  ...  ., r k −1 , x k ) consists of attributes or entities ({x i }) and relations ({r j }). We explore the set of all paths in a breadth first manner starting from t.  ... 
doi:10.1145/3148011.3148027 dblp:conf/kcap/HayesDON17 fatcat:lctj3476bbgv3npokfmk6ywlqq

A Service Recommendation Algorithm based on Knowledge Graph and Collaborative Filtering

Bo Jiang, Junchen Yang, Yanbin Qin, Tian Wang, Muchou Wang, Weifeng Pan
2021 IEEE Access  
When the N is 5, the Precision of top-5 when K is 7 is 14% lower than the Precision of top-5 when K is 5. When N reaches 20, the change in K has little effect on the Precision of the top-20.  ...  FIGURE 5 .FIGURE 6 . 56 Precision of KGCF-SR under different K settings This work is licensed under a Creative Commons Attribution 4.0 License.  ...  In this way, the functions of the mashups can be extracted accurately.  ... 
doi:10.1109/access.2021.3068570 fatcat:w2kcqqdomva3xggychtdprhlze

Cross-Modal Progressive Comprehension for Referring Segmentation [article]

Si Liu, Tianrui Hui, Shaofei Huang, Yunchao Wei, Bo Li, Guanbin Li
2021 arXiv   pre-print
For image data, our CMPC-I module first employs entity and attribute words to perceive all the related entities that might be considered by the expression.  ...  Given a natural language expression and an image/video, the goal of referring segmentation is to produce the pixel-level masks of the entities described by the subject of the expression.  ...  First, we extract linguistic features of entity words and attribute words (e.g., "man" and "white frisbee") from the expression and then fuse them with visual features extracted from the image to build  ... 
arXiv:2105.07175v1 fatcat:z34rf37pnzgtbgcbcranimaqvy

Context-Guided Learning to Rank Entities [chapter]

Makoto P. Kato, Wiradee Imrattanatrai, Takehiro Yamamoto, Hiroaki Ohshima, Katsumi Tanaka
2020 Lecture Notes in Computer Science  
We train linear functions by using samples of ordered entities as training data, and attributes of entities as features.  ...  We propose a method for learning entity orders, for example, safety, popularity, and livability orders of countries.  ...  Iwanari et al. tackled a problem of ordering entities in terms of a given adjective by using some evidences extracted from texts [20] .  ... 
doi:10.1007/978-3-030-45439-5_6 fatcat:gnwngytvljf5hpmwo2fc5qhegm

Event-centric Query Suggestion for Online News [article]

Sachin, Dhaval Patel
2022 arXiv   pre-print
Another problem with query logs in the context of online news is that, they mostly contain queries related to popular events and hence fail to capture less popular events or events which got overshadowed  ...  It is highly useful in situations where the search requirements are not well understood and hence it has been widely adopted by search engines to guide users' search activity.  ...  the extent of media coverage of very sensational and popular events in contrast with less popular events. weight(Ci)= ∑ ∑ rank(k, Ci) k∈Ki,j Di,j∈Di (7) Table 9 shows some of the top keywords that we  ... 
arXiv:2201.04716v1 fatcat:gbi22iarzvawtnbau37ggbmqgm
« Previous Showing results 1 — 15 out of 26,389 results