缩短
发表于 2025-3-27 00:17:02
http://reply.papertrans.cn/24/2350/234993/234993_31.png
一起
发表于 2025-3-27 04:07:11
Conference proceedings 2012siness intelligence; extraction, discovery and clustering; search and documents; data and process modeling; ontology based approaches; variability and evolution; adaptation, preferences and query refinement; queries, matching and topic search; and conceptual modeling in action.
游行
发表于 2025-3-27 07:58:17
http://reply.papertrans.cn/24/2350/234993/234993_33.png
吹气
发表于 2025-3-27 11:27:08
http://reply.papertrans.cn/24/2350/234993/234993_34.png
不公开
发表于 2025-3-27 14:40:22
http://reply.papertrans.cn/24/2350/234993/234993_35.png
不持续就爆
发表于 2025-3-27 21:45:03
Richard S. Aquino,Brooke A. Portertterns within a given application domain that can be mapped repeatedly, as appropriate, to local structures. We formally define canonical and domain structures, mappings to local structures, and functionality. We have implemented several, generic semantic widgets using our approach in an operational educational web repository.
judicial
发表于 2025-3-27 23:07:30
http://reply.papertrans.cn/24/2350/234993/234993_37.png
Pruritus
发表于 2025-3-28 04:01:54
Using Domain Ontologies as Semantic Dimensions in Data Warehousesxtends OLAP (OnLine Analytical Processing) by integrating concept expressions and proper level definitions over domain ontologies into OLAP operations. A prototype demonstrates the feasibility of the approach.
沙文主义
发表于 2025-3-28 06:15:55
Sliced Column-Store (SCS): Ontological Foundations and Practical Implicationss for column-store databases based on representational adequacy. Second, we use these ontological foundations as the basis to propose an extended model of the column-store model called Sliced Column Store (SCS), and show that this model outperforms column-store models for read-oriented queries.
无所不知
发表于 2025-3-28 14:18:02
Fast Group Recommendations by Applying User Clustering base, but we pre-partition users into clusters of similar ones and use the cluster members for recommendations. We efficiently aggregate the single user recommendations into group recommendations by leveraging the power of a top-. algorithm. We evaluate our approach in a real dataset of movie ratings.