Hi all, SG19 Machine Learning meeting will focus on graphs. Michael Wong is inviting you to a scheduled Zoom meeting.Topic: SG19 monthlyTime: 02:00 PM Eastern Time (US and Canada) Every month on the Second Thu,Join from PC, Mac, Linux, iOS or Android:https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09 Password: 035530Or iPhone one-tap : US: +13017158592,,93084591725# or +13126266799,,93084591725#Or Telephone: Dial(for higher quality, dial a number based on your current location): US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782 or 877 853 5247 (Toll Free) Meeting ID: 930 8459 1725 Password: 035530 International numbers available: https://iso.zoom.us/u/agewu4X97Or Skype for Business (Lync): https://iso.zoom.us/skype/93084591725Agenda:1. Opening and introductionsThe ISO Code of conduct:https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdfIEC Code of Conduct:https://www.iec.ch/basecamp/iec-code-conduct-technical-workISO patent policy.https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2The WG21 Practices and Procedures and Code of Conduct:https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures1.1 Roll call of participants
Chris Ryan, Jens Maurer, Kevin Dewesee, Ozan Irsoy, Phil Ratzloff, Rene Rivera, Richard Dosselment, Scott McMillan, MIchael Wong, ka ming chan, Will wray
1.2 Adopt agenda
1.3 Approve minutes from previous meeting, and approve publishing
previously approved minutes to ISOCPP.org
1.4 Action items from previous meetings
2. Main issues (125 min)
2.1 General logistics
Meeting plan, focus on one paper per meeting but does not preclude other
paper updates:
June 9, 2022 02:00 PM ET: Graph
Jul 14, 2022 02:00 PM ET: Matrix, RL and DC
Aug 11, 2022 02:00 PM ET: Stats
Sep 13, 2022 02:00 PM ET: Graph
Oct 12, 2022 02:00 PM ET: Matrix RL/DC
ISO meeting status
future C++ Std meetings
https://cppcon.org/cfs2022/ The submissions deadline is June 24th, with decisions sent by July 31st.
edgeless view
2nd set of functions are for edges on a specific vertex
not supporting due to pairing down so it is returning incoming edges as well
neighbors now instead of adjacency and get source_id and target_id
undirected incidence graph
concept bounds polymorphism on an algo, or like an abstract base class: the undirected incidence and directed incidence graph, the algo used should be well defined - when algo gets target_id, in an undirected graph, it goes to a specific value which is well-defined, but the physical storage can be element 0 source, and 1 is the target for directed graph, but undirected element 0 or 1 could be source or target
undirected graph needs a source-incidence graph (both a source and target id on an edge), directed vs undirected through emulation?
do we need to store source id?
undirected edge value
undirected graph needs a source and target since we need to know where we came from
different names for directed vs undirected or should be unordered on the edge
terminology should reflect the math
better term? unordered edge/ vertices, as long as uid and vid comes out in the result
what's returned by edge list? edgeless G, E
can now port NW graph algorithms as interface is very similar
SG14 at cppcon?
More simple stats: added missing stats: median and mode because they are more involved
weighted percentile, may not have weighted variant of this
looked at python which has bivariate values
might try to extend what we have to support these multivariate stats to be on par with python
prediction needs regression
return a start and end iterator
JM: template argument of subrange can be omitted as it is defaulted
what if looking for n modes in n range: allow user to specify how many modes
JM: why do those 2 ranges need to be same type: value type needs to be friends; yes will make separate
might also need constraints on relationship of value type and allow arithmetic
dof is passed 1 and it will subtract just like python
look at newer ranges algo do
accumulate might need a zipview if precondition has the same length
instead of univariate, bivariate we can condense that down to one
range end iterator is always exclusive : it points to one past the last thing and not second element
mode is sorted